/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:45:21,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:45:21,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:45:21,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:45:21,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:45:21,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:45:21,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:45:21,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:45:21,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:45:21,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:45:21,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:45:21,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:45:21,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:45:21,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:45:21,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:45:21,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:45:21,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:45:21,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:45:21,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:45:21,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:45:21,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:45:21,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:45:21,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:45:21,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:45:21,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:45:21,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:45:21,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:45:21,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:45:21,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:45:21,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:45:21,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:45:21,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:45:21,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:45:21,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:45:21,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:45:21,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:45:21,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:45:21,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:45:21,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:45:21,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:45:21,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:45:21,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:45:21,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:45:21,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:45:21,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:45:21,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:45:21,106 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:45:21,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:45:21,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:45:21,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:45:21,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:45:21,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:45:21,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:45:21,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:45:21,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:45:21,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:45:21,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:45:21,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:45:21,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:45:21,120 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 06:45:21,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:45:21,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:45:21,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:45:21,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:45:21,427 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:45:21,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2022-12-06 06:45:22,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:45:22,737 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:45:22,737 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2022-12-06 06:45:22,753 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c9bc8ef/b866b83016d24fc09cd7cb3c822d78b0/FLAGda712c028 [2022-12-06 06:45:22,764 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c9bc8ef/b866b83016d24fc09cd7cb3c822d78b0 [2022-12-06 06:45:22,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:45:22,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:45:22,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:45:22,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:45:22,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:45:22,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:45:22" (1/1) ... [2022-12-06 06:45:22,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379a600f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:22, skipping insertion in model container [2022-12-06 06:45:22,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:45:22" (1/1) ... [2022-12-06 06:45:22,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:45:22,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:45:22,914 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/safe032_tso.i[945,958] [2022-12-06 06:45:23,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:45:23,061 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:45:23,073 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/safe032_tso.i[945,958] [2022-12-06 06:45:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:23,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:23,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:45:23,134 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:45:23,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23 WrapperNode [2022-12-06 06:45:23,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:45:23,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:45:23,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:45:23,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:45:23,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,170 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-06 06:45:23,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:45:23,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:45:23,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:45:23,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:45:23,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,197 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:45:23,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:45:23,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:45:23,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:45:23,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (1/1) ... [2022-12-06 06:45:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:45:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:45:23,225 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 06:45:23,231 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 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:45:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:45:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:45:23,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:45:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:45:23,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:45:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:45:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:45:23,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:45:23,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:45:23,257 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 06:45:23,349 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:45:23,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:45:23,532 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:45:23,543 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:45:23,543 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:45:23,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:45:23 BoogieIcfgContainer [2022-12-06 06:45:23,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:45:23,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:45:23,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:45:23,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:45:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:45:22" (1/3) ... [2022-12-06 06:45:23,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd321b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:45:23, skipping insertion in model container [2022-12-06 06:45:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:23" (2/3) ... [2022-12-06 06:45:23,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd321b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:45:23, skipping insertion in model container [2022-12-06 06:45:23,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:45:23" (3/3) ... [2022-12-06 06:45:23,555 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_tso.i [2022-12-06 06:45:23,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:45:23,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:45:23,570 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:45:23,639 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:45:23,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-06 06:45:23,762 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-06 06:45:23,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:23,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-06 06:45:23,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-06 06:45:23,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-06 06:45:23,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:23,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-06 06:45:23,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-06 06:45:23,809 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-06 06:45:23,809 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:23,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:45:23,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-06 06:45:23,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 06:45:26,038 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 06:45:26,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:45:26,062 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;@b54a9cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:45:26,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:45:26,070 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 06:45:26,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:26,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:26,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:26,072 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 06:45:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -999261857, now seen corresponding path program 1 times [2022-12-06 06:45:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618558716] [2022-12-06 06:45:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:26,451 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 06:45:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:26,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618558716] [2022-12-06 06:45:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618558716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103892998] [2022-12-06 06:45:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:26,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:26,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:45:26,481 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 06:45:26,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:26,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:45:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:26,635 INFO L130 PetriNetUnfolder]: 520/830 cut-off events. [2022-12-06 06:45:26,635 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 06:45:26,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 830 events. 520/830 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3522 event pairs, 280 based on Foata normal form. 61/891 useless extension candidates. Maximal degree in co-relation 1702. Up to 601 conditions per place. [2022-12-06 06:45:26,641 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 24 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2022-12-06 06:45:26,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 139 flow [2022-12-06 06:45:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:45:26,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 06:45:26,650 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 45 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:45:26,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 139 flow [2022-12-06 06:45:26,652 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 06:45:26,654 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,655 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 06:45:26,657 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 06:45:26,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:26,658 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:26,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:26,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,675 INFO L130 PetriNetUnfolder]: 91/209 cut-off events. [2022-12-06 06:45:26,675 INFO L131 PetriNetUnfolder]: For 43/51 co-relation queries the response was YES. [2022-12-06 06:45:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 209 events. 91/209 cut-off events. For 43/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 966 event pairs, 35 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 458. Up to 113 conditions per place. [2022-12-06 06:45:26,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 06:45:26,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:26,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:45:26,682 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 94 flow [2022-12-06 06:45:26,682 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 06:45:26,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:26,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:26,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:45:26,682 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 06:45:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -912346219, now seen corresponding path program 1 times [2022-12-06 06:45:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159896968] [2022-12-06 06:45:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:26,870 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 06:45:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:26,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159896968] [2022-12-06 06:45:26,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159896968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:26,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:26,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585116537] [2022-12-06 06:45:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:26,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:26,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:45:26,873 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 06:45:26,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:26,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:45:26,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:26,962 INFO L130 PetriNetUnfolder]: 512/818 cut-off events. [2022-12-06 06:45:26,963 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-12-06 06:45:26,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 818 events. 512/818 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3334 event pairs, 75 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 2391. Up to 565 conditions per place. [2022-12-06 06:45:26,968 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 28 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2022-12-06 06:45:26,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 228 flow [2022-12-06 06:45:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:45:26,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-06 06:45:26,970 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 94 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:45:26,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 228 flow [2022-12-06 06:45:26,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:26,975 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,975 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-06 06:45:26,975 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 06:45:26,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:26,976 INFO L89 Accepts]: Start accepts. Operand has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:26,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:26,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,990 INFO L130 PetriNetUnfolder]: 85/199 cut-off events. [2022-12-06 06:45:26,990 INFO L131 PetriNetUnfolder]: For 155/186 co-relation queries the response was YES. [2022-12-06 06:45:26,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 199 events. 85/199 cut-off events. For 155/186 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 896 event pairs, 21 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 543. Up to 108 conditions per place. [2022-12-06 06:45:26,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 06:45:26,997 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:26,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:45:26,998 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 158 flow [2022-12-06 06:45:26,998 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 06:45:26,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:26,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:26,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:45:26,999 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 06:45:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -912346529, now seen corresponding path program 1 times [2022-12-06 06:45:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427800092] [2022-12-06 06:45:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:27,093 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 06:45:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:27,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427800092] [2022-12-06 06:45:27,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427800092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:27,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:27,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833677113] [2022-12-06 06:45:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:27,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:27,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:45:27,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 158 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 06:45:27,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:27,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:45:27,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:27,177 INFO L130 PetriNetUnfolder]: 435/698 cut-off events. [2022-12-06 06:45:27,177 INFO L131 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2022-12-06 06:45:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 698 events. 435/698 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2774 event pairs, 98 based on Foata normal form. 13/711 useless extension candidates. Maximal degree in co-relation 2272. Up to 304 conditions per place. [2022-12-06 06:45:27,181 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 38 selfloop transitions, 7 changer transitions 3/48 dead transitions. [2022-12-06 06:45:27,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 330 flow [2022-12-06 06:45:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:45:27,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-06 06:45:27,182 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 158 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:45:27,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 330 flow [2022-12-06 06:45:27,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:45:27,186 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 06:45:27,187 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-06 06:45:27,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:27,187 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:27,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:27,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,198 INFO L130 PetriNetUnfolder]: 47/124 cut-off events. [2022-12-06 06:45:27,198 INFO L131 PetriNetUnfolder]: For 209/251 co-relation queries the response was YES. [2022-12-06 06:45:27,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 124 events. 47/124 cut-off events. For 209/251 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 453 event pairs, 1 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 430. Up to 66 conditions per place. [2022-12-06 06:45:27,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 06:45:27,206 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:27,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:45:27,207 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 220 flow [2022-12-06 06:45:27,207 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 06:45:27,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:27,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:27,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:45:27,208 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 06:45:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 249790467, now seen corresponding path program 1 times [2022-12-06 06:45:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555276790] [2022-12-06 06:45:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:27,333 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 06:45:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555276790] [2022-12-06 06:45:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555276790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375671362] [2022-12-06 06:45:27,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:27,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:27,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:27,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:27,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:45:27,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 220 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 06:45:27,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:27,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:45:27,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:27,456 INFO L130 PetriNetUnfolder]: 561/904 cut-off events. [2022-12-06 06:45:27,456 INFO L131 PetriNetUnfolder]: For 1476/1476 co-relation queries the response was YES. [2022-12-06 06:45:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 904 events. 561/904 cut-off events. For 1476/1476 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3891 event pairs, 127 based on Foata normal form. 8/912 useless extension candidates. Maximal degree in co-relation 3324. Up to 418 conditions per place. [2022-12-06 06:45:27,460 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 34 selfloop transitions, 13 changer transitions 9/56 dead transitions. [2022-12-06 06:45:27,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 460 flow [2022-12-06 06:45:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:45:27,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-06 06:45:27,461 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 220 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:45:27,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 460 flow [2022-12-06 06:45:27,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:27,467 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-06 06:45:27,467 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-06 06:45:27,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:27,468 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:27,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:27,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,475 INFO L130 PetriNetUnfolder]: 26/84 cut-off events. [2022-12-06 06:45:27,475 INFO L131 PetriNetUnfolder]: For 330/373 co-relation queries the response was YES. [2022-12-06 06:45:27,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 84 events. 26/84 cut-off events. For 330/373 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 289 event pairs, 0 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 361. Up to 40 conditions per place. [2022-12-06 06:45:27,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 06:45:27,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:27,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:45:27,482 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 294 flow [2022-12-06 06:45:27,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 06:45:27,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:27,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:45:27,482 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 06:45:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -592096459, now seen corresponding path program 1 times [2022-12-06 06:45:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:27,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141464604] [2022-12-06 06:45:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:27,558 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 06:45:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141464604] [2022-12-06 06:45:27,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141464604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:27,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:27,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421988412] [2022-12-06 06:45:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:27,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:27,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:27,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 06:45:27,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 294 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 06:45:27,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:27,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 06:45:27,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:27,614 INFO L130 PetriNetUnfolder]: 254/456 cut-off events. [2022-12-06 06:45:27,616 INFO L131 PetriNetUnfolder]: For 1466/1474 co-relation queries the response was YES. [2022-12-06 06:45:27,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 456 events. 254/456 cut-off events. For 1466/1474 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1855 event pairs, 70 based on Foata normal form. 2/456 useless extension candidates. Maximal degree in co-relation 1942. Up to 337 conditions per place. [2022-12-06 06:45:27,621 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 26 selfloop transitions, 9 changer transitions 2/45 dead transitions. [2022-12-06 06:45:27,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 476 flow [2022-12-06 06:45:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 06:45:27,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 06:45:27,623 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 294 flow. Second operand 3 states and 32 transitions. [2022-12-06 06:45:27,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 476 flow [2022-12-06 06:45:27,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 470 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 06:45:27,628 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-06 06:45:27,629 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2022-12-06 06:45:27,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:27,630 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:27,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:27,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,637 INFO L130 PetriNetUnfolder]: 21/72 cut-off events. [2022-12-06 06:45:27,637 INFO L131 PetriNetUnfolder]: For 304/351 co-relation queries the response was YES. [2022-12-06 06:45:27,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 72 events. 21/72 cut-off events. For 304/351 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 226 event pairs, 0 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 338. Up to 34 conditions per place. [2022-12-06 06:45:27,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 06:45:27,641 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:27,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 06:45:27,642 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 360 flow [2022-12-06 06:45:27,642 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 06:45:27,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:27,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:27,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:45:27,643 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 06:45:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1153604289, now seen corresponding path program 1 times [2022-12-06 06:45:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:27,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638803665] [2022-12-06 06:45:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:27,732 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 06:45:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638803665] [2022-12-06 06:45:27,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638803665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:27,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:27,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811789583] [2022-12-06 06:45:27,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:27,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:27,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-06 06:45:27,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 360 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 06:45:27,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:27,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-06 06:45:27,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:27,799 INFO L130 PetriNetUnfolder]: 187/378 cut-off events. [2022-12-06 06:45:27,799 INFO L131 PetriNetUnfolder]: For 2470/2502 co-relation queries the response was YES. [2022-12-06 06:45:27,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 378 events. 187/378 cut-off events. For 2470/2502 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1770 event pairs, 29 based on Foata normal form. 13/384 useless extension candidates. Maximal degree in co-relation 1646. Up to 180 conditions per place. [2022-12-06 06:45:27,802 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 53 selfloop transitions, 8 changer transitions 2/76 dead transitions. [2022-12-06 06:45:27,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 887 flow [2022-12-06 06:45:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:45:27,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2022-12-06 06:45:27,803 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 360 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:45:27,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 887 flow [2022-12-06 06:45:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 858 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:27,807 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 406 flow [2022-12-06 06:45:27,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-06 06:45:27,808 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2022-12-06 06:45:27,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:27,808 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 406 flow [2022-12-06 06:45:27,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:27,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:27,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 406 flow [2022-12-06 06:45:27,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 406 flow [2022-12-06 06:45:27,821 INFO L130 PetriNetUnfolder]: 60/163 cut-off events. [2022-12-06 06:45:27,821 INFO L131 PetriNetUnfolder]: For 592/652 co-relation queries the response was YES. [2022-12-06 06:45:27,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 163 events. 60/163 cut-off events. For 592/652 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 776 event pairs, 13 based on Foata normal form. 9/160 useless extension candidates. Maximal degree in co-relation 652. Up to 88 conditions per place. [2022-12-06 06:45:27,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 406 flow [2022-12-06 06:45:27,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 06:45:27,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L785-3-->L789: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31| (mod v_~main$tmp_guard0~0_28 256)) (= v_~main$tmp_guard0~0_28 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[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 [233] L761-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 06:45:27,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L785-3-->L789: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31| (mod v_~main$tmp_guard0~0_28 256)) (= v_~main$tmp_guard0~0_28 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[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 [237] L746-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 06:45:27,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [247] L785-3-->L789: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31| (mod v_~main$tmp_guard0~0_28 256)) (= v_~main$tmp_guard0~0_28 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[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 [243] L729-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:45:27,937 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:45:27,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 06:45:27,948 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 382 flow [2022-12-06 06:45:27,948 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 06:45:27,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:27,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:27,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:45:27,948 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 06:45:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash 244411788, now seen corresponding path program 1 times [2022-12-06 06:45:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:27,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635293345] [2022-12-06 06:45:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:28,036 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 06:45:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635293345] [2022-12-06 06:45:28,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635293345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:28,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:28,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468283647] [2022-12-06 06:45:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:28,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:28,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:28,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-06 06:45:28,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 382 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 06:45:28,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:28,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-06 06:45:28,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:28,107 INFO L130 PetriNetUnfolder]: 121/261 cut-off events. [2022-12-06 06:45:28,107 INFO L131 PetriNetUnfolder]: For 1696/1728 co-relation queries the response was YES. [2022-12-06 06:45:28,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 261 events. 121/261 cut-off events. For 1696/1728 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1089 event pairs, 15 based on Foata normal form. 19/274 useless extension candidates. Maximal degree in co-relation 1302. Up to 116 conditions per place. [2022-12-06 06:45:28,109 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 45 selfloop transitions, 11 changer transitions 5/74 dead transitions. [2022-12-06 06:45:28,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 860 flow [2022-12-06 06:45:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:45:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:45:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 06:45:28,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-06 06:45:28,112 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 382 flow. Second operand 6 states and 63 transitions. [2022-12-06 06:45:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 860 flow [2022-12-06 06:45:28,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 854 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:28,117 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 456 flow [2022-12-06 06:45:28,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-06 06:45:28,118 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2022-12-06 06:45:28,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:28,118 INFO L89 Accepts]: Start accepts. Operand has 54 places, 44 transitions, 456 flow [2022-12-06 06:45:28,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:28,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:28,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 456 flow [2022-12-06 06:45:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 456 flow [2022-12-06 06:45:28,130 INFO L130 PetriNetUnfolder]: 34/111 cut-off events. [2022-12-06 06:45:28,130 INFO L131 PetriNetUnfolder]: For 485/546 co-relation queries the response was YES. [2022-12-06 06:45:28,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 111 events. 34/111 cut-off events. For 485/546 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 465 event pairs, 1 based on Foata normal form. 3/111 useless extension candidates. Maximal degree in co-relation 529. Up to 60 conditions per place. [2022-12-06 06:45:28,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 456 flow [2022-12-06 06:45:28,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:45:28,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:28,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 06:45:28,195 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 446 flow [2022-12-06 06:45:28,195 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 06:45:28,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:28,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:28,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:45:28,196 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 06:45:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1212104237, now seen corresponding path program 1 times [2022-12-06 06:45:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144488733] [2022-12-06 06:45:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:28,288 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 06:45:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:28,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144488733] [2022-12-06 06:45:28,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144488733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:28,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:28,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440830235] [2022-12-06 06:45:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:28,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:28,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-06 06:45:28,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 446 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 06:45:28,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:28,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-06 06:45:28,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:28,334 INFO L130 PetriNetUnfolder]: 88/184 cut-off events. [2022-12-06 06:45:28,334 INFO L131 PetriNetUnfolder]: For 1249/1275 co-relation queries the response was YES. [2022-12-06 06:45:28,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 184 events. 88/184 cut-off events. For 1249/1275 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 694 event pairs, 14 based on Foata normal form. 13/191 useless extension candidates. Maximal degree in co-relation 988. Up to 67 conditions per place. [2022-12-06 06:45:28,335 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2022-12-06 06:45:28,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 636 flow [2022-12-06 06:45:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 06:45:28,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:45:28,336 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 446 flow. Second operand 5 states and 44 transitions. [2022-12-06 06:45:28,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 636 flow [2022-12-06 06:45:28,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 588 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 06:45:28,339 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2022-12-06 06:45:28,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2022-12-06 06:45:28,341 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 21 predicate places. [2022-12-06 06:45:28,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:28,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 0 transitions, 0 flow [2022-12-06 06:45:28,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 06:45:28,342 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 06:45:28,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:28,342 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 06:45:28,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 06:45:28,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 06:45:28,342 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:28,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 06:45:28,344 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 06:45:28,344 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 06:45:28,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:45:28,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:45:28,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:45:28,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:45:28,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:45:28,346 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:28,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:45:28,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:45:28,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:45:28 BasicIcfg [2022-12-06 06:45:28,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:45:28,352 INFO L158 Benchmark]: Toolchain (without parser) took 5585.65ms. Allocated memory was 192.9MB in the beginning and 273.7MB in the end (delta: 80.7MB). Free memory was 158.3MB in the beginning and 139.4MB in the end (delta: 18.9MB). Peak memory consumption was 100.6MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,353 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 170.8MB in the beginning and 170.8MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:45:28,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.65ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 134.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.64ms. Allocated memory is still 192.9MB. Free memory was 134.7MB in the beginning and 132.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,353 INFO L158 Benchmark]: Boogie Preprocessor took 27.83ms. Allocated memory is still 192.9MB. Free memory was 132.7MB in the beginning and 131.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,353 INFO L158 Benchmark]: RCFGBuilder took 345.52ms. Allocated memory is still 192.9MB. Free memory was 131.0MB in the beginning and 117.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,354 INFO L158 Benchmark]: TraceAbstraction took 4805.43ms. Allocated memory was 192.9MB in the beginning and 273.7MB in the end (delta: 80.7MB). Free memory was 117.0MB in the beginning and 139.4MB in the end (delta: -22.4MB). Peak memory consumption was 59.7MB. Max. memory is 8.0GB. [2022-12-06 06:45:28,355 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.11ms. Allocated memory is still 192.9MB. Free memory was 170.8MB in the beginning and 170.8MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.65ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 134.7MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.64ms. Allocated memory is still 192.9MB. Free memory was 134.7MB in the beginning and 132.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.83ms. Allocated memory is still 192.9MB. Free memory was 132.7MB in the beginning and 131.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.52ms. Allocated memory is still 192.9MB. Free memory was 131.0MB in the beginning and 117.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4805.43ms. Allocated memory was 192.9MB in the beginning and 273.7MB in the end (delta: 80.7MB). Free memory was 117.0MB in the beginning and 139.4MB in the end (delta: -22.4MB). Peak memory consumption was 59.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 78 PlacesBefore, 27 PlacesAfterwards, 69 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 770, independent: 734, independent conditional: 734, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 770, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 770, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 770, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 654, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 654, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 770, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 933, Positive conditional cache size: 0, Positive unconditional cache size: 933, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 2, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 17, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 50, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 51, independent conditional: 10, independent unconditional: 41, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 59, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, 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: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 55, independent conditional: 55, 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: 64, independent: 55, independent conditional: 11, independent unconditional: 44, 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: 64, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 64, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 64, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, 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: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 38 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 45, independent unconditional: 51, 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: 96, independent: 96, independent conditional: 45, independent unconditional: 51, 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: 14, independent: 14, independent conditional: 6, independent unconditional: 8, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 96, independent: 82, independent conditional: 39, independent unconditional: 43, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 37, Positive conditional cache size: 6, Positive unconditional cache size: 31, 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: 51, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 19, independent unconditional: 4, 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: 23, independent: 23, independent conditional: 11, independent unconditional: 12, 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: 23, independent: 23, independent conditional: 11, independent unconditional: 12, 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: 1, independent: 1, independent conditional: 1, 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: 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: 23, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 38, Positive conditional cache size: 7, Positive unconditional cache size: 31, 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): 41, Positive cache size: 38, Positive conditional cache size: 7, Positive unconditional cache size: 31, 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, 107 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: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 12 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=7, InterpolantAutomatonStates: 34, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 06:45:28,387 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...