/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:14:35,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:14:35,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:14:35,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:14:35,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:14:35,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:14:35,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:14:35,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:14:35,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:14:35,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:14:35,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:14:35,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:14:35,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:14:35,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:14:35,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:14:35,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:14:35,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:14:35,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:14:35,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:14:35,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:14:35,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:14:35,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:14:35,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:14:35,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:14:35,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:14:35,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:14:35,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:14:35,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:14:35,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:14:35,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:14:35,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:14:35,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:14:35,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:14:35,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:14:35,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:14:35,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:14:35,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:14:35,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:14:35,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:14:35,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:14:35,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:14:35,179 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-RepeatedSemanticLbe.epf [2022-12-05 23:14:35,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:14:35,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:14:35,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:14:35,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:14:35,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:14:35,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:14:35,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:14:35,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:14:35,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:14:35,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:14:35,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:14:35,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:14:35,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:14:35,216 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:14:35,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:14:35,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:14:35,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:14:35,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:14:35,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:14:35,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:14:35,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:14:35,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:14:35,218 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-05 23:14:35,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:14:35,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:14:35,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:14:35,501 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:14:35,502 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:14:35,503 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:14:36,396 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:14:36,622 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:14:36,623 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:14:36,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8842ffd96/da079548be9a40c698e5cb3ded9a46cb/FLAG906574f4c [2022-12-05 23:14:36,648 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8842ffd96/da079548be9a40c698e5cb3ded9a46cb [2022-12-05 23:14:36,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:14:36,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:14:36,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:14:36,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:14:36,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:14:36,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:14:36" (1/1) ... [2022-12-05 23:14:36,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22772b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:36, skipping insertion in model container [2022-12-05 23:14:36,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:14:36" (1/1) ... [2022-12-05 23:14:36,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:14:36,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:14:36,836 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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:14:36,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:36,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:36,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:14:36,986 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:14:36,996 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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:14:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:14:37,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:14:37,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:14:37,063 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:14:37,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37 WrapperNode [2022-12-05 23:14:37,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:14:37,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:14:37,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:14:37,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:14:37,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,109 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-12-05 23:14:37,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:14:37,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:14:37,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:14:37,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:14:37,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,128 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:14:37,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:14:37,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:14:37,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:14:37,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (1/1) ... [2022-12-05 23:14:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:14:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:14:37,173 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-05 23:14:37,179 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-05 23:14:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:14:37,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:14:37,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:14:37,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:14:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:14:37,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:14:37,203 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:14:37,318 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:14:37,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:14:37,466 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:14:37,472 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:14:37,472 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:14:37,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:14:37 BoogieIcfgContainer [2022-12-05 23:14:37,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:14:37,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:14:37,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:14:37,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:14:37,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:14:36" (1/3) ... [2022-12-05 23:14:37,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524baea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:14:37, skipping insertion in model container [2022-12-05 23:14:37,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:14:37" (2/3) ... [2022-12-05 23:14:37,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524baea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:14:37, skipping insertion in model container [2022-12-05 23:14:37,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:14:37" (3/3) ... [2022-12-05 23:14:37,481 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:14:37,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:14:37,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:14:37,497 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:14:37,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:14:37,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 185 flow [2022-12-05 23:14:37,705 INFO L130 PetriNetUnfolder]: 2/82 cut-off events. [2022-12-05 23:14:37,706 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:37,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-05 23:14:37,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 85 transitions, 185 flow [2022-12-05 23:14:37,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 70 transitions, 149 flow [2022-12-05 23:14:37,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:37,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-05 23:14:37,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 70 transitions, 149 flow [2022-12-05 23:14:37,789 INFO L130 PetriNetUnfolder]: 1/70 cut-off events. [2022-12-05 23:14:37,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:37,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 23:14:37,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 70 transitions, 149 flow [2022-12-05 23:14:37,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-05 23:14:39,797 INFO L203 LiptonReduction]: Total number of compositions: 53 [2022-12-05 23:14:39,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:14:39,812 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;@22e866c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:14:39,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:14:39,814 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 23:14:39,814 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:39,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:39,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:39,815 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-05 23:14:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 229073430, now seen corresponding path program 1 times [2022-12-05 23:14:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:39,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790211981] [2022-12-05 23:14:39,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:39,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:39,976 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-05 23:14:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:39,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790211981] [2022-12-05 23:14:39,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790211981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:39,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:39,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:14:39,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639538765] [2022-12-05 23:14:39,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:39,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:14:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:39,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:14:39,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:14:39,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-05 23:14:39,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 45 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-05 23:14:39,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:39,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-05 23:14:39,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:40,057 INFO L130 PetriNetUnfolder]: 164/296 cut-off events. [2022-12-05 23:14:40,057 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 23:14:40,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 296 events. 164/296 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1225 event pairs, 164 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 586. Up to 271 conditions per place. [2022-12-05 23:14:40,060 INFO L137 encePairwiseOnDemand]: 17/18 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-05 23:14:40,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 17 transitions, 71 flow [2022-12-05 23:14:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:14:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:14:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-05 23:14:40,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:14:40,068 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 45 flow. Second operand 2 states and 21 transitions. [2022-12-05 23:14:40,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 17 transitions, 71 flow [2022-12-05 23:14:40,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:14:40,071 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 40 flow [2022-12-05 23:14:40,072 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=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 23:14:40,074 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 23:14:40,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:40,075 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 40 flow [2022-12-05 23:14:40,076 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:40,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:40,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 40 flow [2022-12-05 23:14:40,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 40 flow [2022-12-05 23:14:40,084 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:14:40,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:40,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:14:40,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 40 flow [2022-12-05 23:14:40,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-05 23:14:40,103 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:40,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 23:14:40,105 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 40 flow [2022-12-05 23:14:40,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-05 23:14:40,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:40,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:40,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:14:40,119 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-05 23:14:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1488657983, now seen corresponding path program 1 times [2022-12-05 23:14:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:40,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17365868] [2022-12-05 23:14:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:40,309 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-05 23:14:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17365868] [2022-12-05 23:14:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17365868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:40,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:40,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:14:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76284763] [2022-12-05 23:14:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:14:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:14:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:14:40,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:14:40,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-05 23:14:40,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:40,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:14:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:40,414 INFO L130 PetriNetUnfolder]: 418/718 cut-off events. [2022-12-05 23:14:40,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:40,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 718 events. 418/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3404 event pairs, 155 based on Foata normal form. 31/748 useless extension candidates. Maximal degree in co-relation 1450. Up to 416 conditions per place. [2022-12-05 23:14:40,419 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2022-12-05 23:14:40,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 128 flow [2022-12-05 23:14:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:14:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:14:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:14:40,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-05 23:14:40,420 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:14:40,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 128 flow [2022-12-05 23:14:40,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:14:40,421 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-05 23:14:40,422 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-05 23:14:40,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:40,422 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,422 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:40,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:40,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,430 INFO L130 PetriNetUnfolder]: 47/139 cut-off events. [2022-12-05 23:14:40,430 INFO L131 PetriNetUnfolder]: For 17/25 co-relation queries the response was YES. [2022-12-05 23:14:40,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 139 events. 47/139 cut-off events. For 17/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 657 event pairs, 19 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 280. Up to 66 conditions per place. [2022-12-05 23:14:40,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-05 23:14:40,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:40,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-05 23:14:40,435 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 86 flow [2022-12-05 23:14:40,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-05 23:14:40,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:40,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:14:40,436 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-05 23:14:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1096243217, now seen corresponding path program 1 times [2022-12-05 23:14:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:40,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327926046] [2022-12-05 23:14:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:40,526 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-05 23:14:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327926046] [2022-12-05 23:14:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327926046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:40,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:14:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293152230] [2022-12-05 23:14:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:14:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:14:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:14:40,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-05 23:14:40,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-05 23:14:40,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:40,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-05 23:14:40,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:40,588 INFO L130 PetriNetUnfolder]: 328/584 cut-off events. [2022-12-05 23:14:40,588 INFO L131 PetriNetUnfolder]: For 208/211 co-relation queries the response was YES. [2022-12-05 23:14:40,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 584 events. 328/584 cut-off events. For 208/211 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2809 event pairs, 99 based on Foata normal form. 11/575 useless extension candidates. Maximal degree in co-relation 1473. Up to 341 conditions per place. [2022-12-05 23:14:40,591 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-05 23:14:40,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 160 flow [2022-12-05 23:14:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:14:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:14:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 23:14:40,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2022-12-05 23:14:40,593 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 86 flow. Second operand 3 states and 29 transitions. [2022-12-05 23:14:40,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 160 flow [2022-12-05 23:14:40,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:14:40,597 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2022-12-05 23:14:40,598 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-05 23:14:40,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:40,598 INFO L89 Accepts]: Start accepts. Operand has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,599 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:40,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:40,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,607 INFO L130 PetriNetUnfolder]: 32/107 cut-off events. [2022-12-05 23:14:40,607 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:14:40,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 107 events. 32/107 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 462 event pairs, 7 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 210. Up to 48 conditions per place. [2022-12-05 23:14:40,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-05 23:14:40,612 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:40,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:14:40,613 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 85 flow [2022-12-05 23:14:40,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-05 23:14:40,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:40,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:40,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:14:40,614 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-05 23:14:40,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1096242411, now seen corresponding path program 1 times [2022-12-05 23:14:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:40,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214870745] [2022-12-05 23:14:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:40,749 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-05 23:14:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:40,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214870745] [2022-12-05 23:14:40,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214870745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:40,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:40,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:14:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403603757] [2022-12-05 23:14:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:40,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:14:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:14:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:14:40,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:14:40,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-05 23:14:40,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:40,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:14:40,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:40,838 INFO L130 PetriNetUnfolder]: 361/624 cut-off events. [2022-12-05 23:14:40,838 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-05 23:14:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 624 events. 361/624 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2884 event pairs, 85 based on Foata normal form. 8/624 useless extension candidates. Maximal degree in co-relation 1648. Up to 297 conditions per place. [2022-12-05 23:14:40,863 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 35 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-05 23:14:40,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 237 flow [2022-12-05 23:14:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:14:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:14:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:14:40,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2022-12-05 23:14:40,865 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 85 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:14:40,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 237 flow [2022-12-05 23:14:40,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:14:40,867 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-05 23:14:40,867 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-05 23:14:40,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:40,867 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,868 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:40,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:40,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,874 INFO L130 PetriNetUnfolder]: 26/97 cut-off events. [2022-12-05 23:14:40,874 INFO L131 PetriNetUnfolder]: For 67/84 co-relation queries the response was YES. [2022-12-05 23:14:40,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 97 events. 26/97 cut-off events. For 67/84 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 417 event pairs, 7 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 249. Up to 39 conditions per place. [2022-12-05 23:14:40,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-05 23:14:40,876 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:40,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:14:40,877 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 128 flow [2022-12-05 23:14:40,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-05 23:14:40,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:40,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:40,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:14:40,877 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-05 23:14:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:40,878 INFO L85 PathProgramCache]: Analyzing trace with hash -376199013, now seen corresponding path program 1 times [2022-12-05 23:14:40,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:40,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548367983] [2022-12-05 23:14:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:40,944 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-05 23:14:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:40,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548367983] [2022-12-05 23:14:40,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548367983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:40,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:40,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:14:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337152948] [2022-12-05 23:14:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:40,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:14:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:14:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:14:40,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:14:40,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-05 23:14:40,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:40,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:14:40,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:41,019 INFO L130 PetriNetUnfolder]: 417/736 cut-off events. [2022-12-05 23:14:41,019 INFO L131 PetriNetUnfolder]: For 805/805 co-relation queries the response was YES. [2022-12-05 23:14:41,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 736 events. 417/736 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3573 event pairs, 104 based on Foata normal form. 20/754 useless extension candidates. Maximal degree in co-relation 2196. Up to 343 conditions per place. [2022-12-05 23:14:41,022 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 6 changer transitions 7/44 dead transitions. [2022-12-05 23:14:41,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 307 flow [2022-12-05 23:14:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:14:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:14:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-05 23:14:41,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-05 23:14:41,025 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 128 flow. Second operand 4 states and 37 transitions. [2022-12-05 23:14:41,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 307 flow [2022-12-05 23:14:41,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:14:41,039 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-05 23:14:41,040 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-05 23:14:41,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:41,040 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,041 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:41,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:41,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,046 INFO L130 PetriNetUnfolder]: 15/68 cut-off events. [2022-12-05 23:14:41,046 INFO L131 PetriNetUnfolder]: For 65/89 co-relation queries the response was YES. [2022-12-05 23:14:41,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 68 events. 15/68 cut-off events. For 65/89 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 239 event pairs, 5 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 197. Up to 29 conditions per place. [2022-12-05 23:14:41,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-05 23:14:41,047 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:41,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:14:41,048 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 143 flow [2022-12-05 23:14:41,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-05 23:14:41,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:41,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:41,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:14:41,048 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-05 23:14:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 361822421, now seen corresponding path program 1 times [2022-12-05 23:14:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:41,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042145543] [2022-12-05 23:14:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:41,118 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-05 23:14:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:41,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042145543] [2022-12-05 23:14:41,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042145543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:41,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:41,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:14:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400864267] [2022-12-05 23:14:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:41,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:14:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:14:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:14:41,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:14:41,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-05 23:14:41,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:41,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:14:41,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:41,186 INFO L130 PetriNetUnfolder]: 260/469 cut-off events. [2022-12-05 23:14:41,187 INFO L131 PetriNetUnfolder]: For 548/548 co-relation queries the response was YES. [2022-12-05 23:14:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 469 events. 260/469 cut-off events. For 548/548 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2001 event pairs, 62 based on Foata normal form. 6/473 useless extension candidates. Maximal degree in co-relation 1526. Up to 228 conditions per place. [2022-12-05 23:14:41,189 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2022-12-05 23:14:41,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 299 flow [2022-12-05 23:14:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:14:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:14:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 23:14:41,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-05 23:14:41,193 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 143 flow. Second operand 4 states and 40 transitions. [2022-12-05 23:14:41,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 299 flow [2022-12-05 23:14:41,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 265 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-05 23:14:41,196 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-05 23:14:41,198 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-05 23:14:41,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:41,198 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,199 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:41,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:41,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,204 INFO L130 PetriNetUnfolder]: 12/60 cut-off events. [2022-12-05 23:14:41,204 INFO L131 PetriNetUnfolder]: For 81/107 co-relation queries the response was YES. [2022-12-05 23:14:41,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 60 events. 12/60 cut-off events. For 81/107 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2022-12-05 23:14:41,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-05 23:14:41,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:41,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:14:41,208 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 183 flow [2022-12-05 23:14:41,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-05 23:14:41,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:41,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:41,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:14:41,208 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-05 23:14:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -749814489, now seen corresponding path program 1 times [2022-12-05 23:14:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:41,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566266428] [2022-12-05 23:14:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:41,345 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-05 23:14:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566266428] [2022-12-05 23:14:41,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566266428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:41,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:41,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:14:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266373961] [2022-12-05 23:14:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:41,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:14:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:14:41,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:14:41,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:14:41,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 183 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:14:41,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:41,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:14:41,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:41,429 INFO L130 PetriNetUnfolder]: 390/663 cut-off events. [2022-12-05 23:14:41,430 INFO L131 PetriNetUnfolder]: For 1404/1404 co-relation queries the response was YES. [2022-12-05 23:14:41,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 663 events. 390/663 cut-off events. For 1404/1404 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2643 event pairs, 126 based on Foata normal form. 18/681 useless extension candidates. Maximal degree in co-relation 2202. Up to 299 conditions per place. [2022-12-05 23:14:41,432 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 26 selfloop transitions, 6 changer transitions 15/47 dead transitions. [2022-12-05 23:14:41,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 383 flow [2022-12-05 23:14:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:14:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:14:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 23:14:41,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2022-12-05 23:14:41,434 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 183 flow. Second operand 5 states and 36 transitions. [2022-12-05 23:14:41,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 383 flow [2022-12-05 23:14:41,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:14:41,437 INFO L231 Difference]: Finished difference. Result has 43 places, 21 transitions, 139 flow [2022-12-05 23:14:41,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2022-12-05 23:14:41,438 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-05 23:14:41,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:41,438 INFO L89 Accepts]: Start accepts. Operand has 43 places, 21 transitions, 139 flow [2022-12-05 23:14:41,439 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:41,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:41,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 21 transitions, 139 flow [2022-12-05 23:14:41,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 21 transitions, 139 flow [2022-12-05 23:14:41,444 INFO L130 PetriNetUnfolder]: 2/30 cut-off events. [2022-12-05 23:14:41,445 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-05 23:14:41,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 30 events. 2/30 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 95. Up to 11 conditions per place. [2022-12-05 23:14:41,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 21 transitions, 139 flow [2022-12-05 23:14:41,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 23:14:41,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [257] $Ultimate##0-->L729: Formula: (and (= v_~y~0_40 v_~__unbuffered_p0_EAX~0_60) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~__unbuffered_p0_EBX~0_54 v_~x~0_85) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_85} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_85, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [184] L741-->L744: Formula: (= 2 v_~x~0_3) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] [2022-12-05 23:14:41,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [236] $Ultimate##0-->L741: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_~x~0_39 1) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [228] $Ultimate##0-->L756: Formula: (and (= v_~x~0_29 v_~__unbuffered_p2_EAX~0_20) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x~0=v_~x~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-05 23:14:41,523 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:14:41,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-05 23:14:41,524 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 152 flow [2022-12-05 23:14:41,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:14:41,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:41,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:41,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:14:41,524 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-05 23:14:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -532257916, now seen corresponding path program 1 times [2022-12-05 23:14:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:41,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089056705] [2022-12-05 23:14:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:41,613 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-05 23:14:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:41,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089056705] [2022-12-05 23:14:41,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089056705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:41,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:41,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:14:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844963975] [2022-12-05 23:14:41,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:14:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:14:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:14:41,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-05 23:14:41,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 21 transitions, 152 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-05 23:14:41,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:41,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-05 23:14:41,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:41,667 INFO L130 PetriNetUnfolder]: 98/205 cut-off events. [2022-12-05 23:14:41,668 INFO L131 PetriNetUnfolder]: For 708/714 co-relation queries the response was YES. [2022-12-05 23:14:41,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 205 events. 98/205 cut-off events. For 708/714 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 831 event pairs, 24 based on Foata normal form. 12/210 useless extension candidates. Maximal degree in co-relation 704. Up to 124 conditions per place. [2022-12-05 23:14:41,669 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 23 selfloop transitions, 6 changer transitions 10/43 dead transitions. [2022-12-05 23:14:41,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 367 flow [2022-12-05 23:14:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:14:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:14:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-05 23:14:41,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2022-12-05 23:14:41,671 INFO L175 Difference]: Start difference. First operand has 43 places, 21 transitions, 152 flow. Second operand 5 states and 56 transitions. [2022-12-05 23:14:41,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 367 flow [2022-12-05 23:14:41,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 265 flow, removed 10 selfloop flow, removed 11 redundant places. [2022-12-05 23:14:41,673 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 136 flow [2022-12-05 23:14:41,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-05 23:14:41,675 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2022-12-05 23:14:41,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:41,675 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 136 flow [2022-12-05 23:14:41,675 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:41,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:41,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 136 flow [2022-12-05 23:14:41,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 136 flow [2022-12-05 23:14:41,683 INFO L130 PetriNetUnfolder]: 32/103 cut-off events. [2022-12-05 23:14:41,683 INFO L131 PetriNetUnfolder]: For 166/188 co-relation queries the response was YES. [2022-12-05 23:14:41,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 103 events. 32/103 cut-off events. For 166/188 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 436 event pairs, 17 based on Foata normal form. 4/99 useless extension candidates. Maximal degree in co-relation 319. Up to 66 conditions per place. [2022-12-05 23:14:41,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 136 flow [2022-12-05 23:14:41,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-05 23:14:41,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [256] L783-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= v_~__unbuffered_cnt~0_155 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [227] L759-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P2Thread1of1ForFork0_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 23:14:41,735 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:14:41,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-05 23:14:41,737 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 132 flow [2022-12-05 23:14:41,737 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-05 23:14:41,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:41,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:41,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:14:41,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:14:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1227479360, now seen corresponding path program 1 times [2022-12-05 23:14:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:41,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768205509] [2022-12-05 23:14:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:41,817 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-05 23:14:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768205509] [2022-12-05 23:14:41,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768205509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:41,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:14:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304745024] [2022-12-05 23:14:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:41,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:14:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:14:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:14:41,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 23:14:41,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:14:41,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:41,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 23:14:41,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:41,852 INFO L130 PetriNetUnfolder]: 86/197 cut-off events. [2022-12-05 23:14:41,853 INFO L131 PetriNetUnfolder]: For 333/353 co-relation queries the response was YES. [2022-12-05 23:14:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 197 events. 86/197 cut-off events. For 333/353 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 834 event pairs, 56 based on Foata normal form. 10/201 useless extension candidates. Maximal degree in co-relation 750. Up to 112 conditions per place. [2022-12-05 23:14:41,854 INFO L137 encePairwiseOnDemand]: 17/19 looper letters, 16 selfloop transitions, 0 changer transitions 14/32 dead transitions. [2022-12-05 23:14:41,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 240 flow [2022-12-05 23:14:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:14:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:14:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 23:14:41,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-05 23:14:41,854 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 132 flow. Second operand 3 states and 30 transitions. [2022-12-05 23:14:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 240 flow [2022-12-05 23:14:41,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 236 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 23:14:41,856 INFO L231 Difference]: Finished difference. Result has 40 places, 18 transitions, 96 flow [2022-12-05 23:14:41,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2022-12-05 23:14:41,856 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2022-12-05 23:14:41,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:41,856 INFO L89 Accepts]: Start accepts. Operand has 40 places, 18 transitions, 96 flow [2022-12-05 23:14:41,857 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:41,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:41,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 18 transitions, 96 flow [2022-12-05 23:14:41,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 18 transitions, 96 flow [2022-12-05 23:14:41,862 INFO L130 PetriNetUnfolder]: 7/39 cut-off events. [2022-12-05 23:14:41,862 INFO L131 PetriNetUnfolder]: For 76/78 co-relation queries the response was YES. [2022-12-05 23:14:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 39 events. 7/39 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 90 event pairs, 6 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 117. Up to 22 conditions per place. [2022-12-05 23:14:41,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 18 transitions, 96 flow [2022-12-05 23:14:41,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-05 23:14:41,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [259] $Ultimate##0-->L759: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~y~0_44 1) (= v_~x~0_91 v_~__unbuffered_p2_EAX~0_62) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~x~0=v_~x~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~y~0=v_~y~0_44, ~x~0=v_~x~0_91, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] and [254] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_24 v_~__unbuffered_p0_EAX~0_45)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_24, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-05 23:14:41,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [263] $Ultimate##0-->L726: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_68) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= v_~y~0_48 v_~__unbuffered_p0_EAX~0_64) (= v_~y~0_48 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_48, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork1_~arg.base] and [227] L759-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P2Thread1of1ForFork0_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 23:14:42,037 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:14:42,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-05 23:14:42,038 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 15 transitions, 99 flow [2022-12-05 23:14:42,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:14:42,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:42,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:42,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:14:42,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:14:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -312436756, now seen corresponding path program 1 times [2022-12-05 23:14:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:42,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270007578] [2022-12-05 23:14:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:42,102 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-05 23:14:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:42,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270007578] [2022-12-05 23:14:42,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270007578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:42,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:42,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:14:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101631672] [2022-12-05 23:14:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:42,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:14:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:14:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:14:42,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:14:42,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 15 transitions, 99 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-05 23:14:42,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:42,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:14:42,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:42,143 INFO L130 PetriNetUnfolder]: 14/46 cut-off events. [2022-12-05 23:14:42,143 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-05 23:14:42,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 46 events. 14/46 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 3 based on Foata normal form. 3/49 useless extension candidates. Maximal degree in co-relation 208. Up to 25 conditions per place. [2022-12-05 23:14:42,143 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 12 selfloop transitions, 5 changer transitions 12/29 dead transitions. [2022-12-05 23:14:42,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 244 flow [2022-12-05 23:14:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:14:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:14:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-12-05 23:14:42,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-05 23:14:42,144 INFO L175 Difference]: Start difference. First operand has 34 places, 15 transitions, 99 flow. Second operand 6 states and 31 transitions. [2022-12-05 23:14:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 244 flow [2022-12-05 23:14:42,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 212 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-05 23:14:42,145 INFO L231 Difference]: Finished difference. Result has 37 places, 15 transitions, 101 flow [2022-12-05 23:14:42,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=15} [2022-12-05 23:14:42,145 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-05 23:14:42,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:14:42,146 INFO L89 Accepts]: Start accepts. Operand has 37 places, 15 transitions, 101 flow [2022-12-05 23:14:42,146 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:14:42,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:42,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 15 transitions, 101 flow [2022-12-05 23:14:42,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 15 transitions, 101 flow [2022-12-05 23:14:42,148 INFO L130 PetriNetUnfolder]: 2/19 cut-off events. [2022-12-05 23:14:42,148 INFO L131 PetriNetUnfolder]: For 41/43 co-relation queries the response was YES. [2022-12-05 23:14:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 19 events. 2/19 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 1 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 71. Up to 9 conditions per place. [2022-12-05 23:14:42,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 15 transitions, 101 flow [2022-12-05 23:14:42,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-05 23:14:42,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [263] $Ultimate##0-->L726: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_68) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= v_~y~0_48 v_~__unbuffered_p0_EAX~0_64) (= v_~y~0_48 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_48, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork1_~arg.base] and [227] L759-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P2Thread1of1ForFork0_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 23:14:42,258 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:14:42,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-05 23:14:42,259 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 13 transitions, 97 flow [2022-12-05 23:14:42,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-05 23:14:42,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:14:42,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:42,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:14:42,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 23:14:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:14:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1096253344, now seen corresponding path program 1 times [2022-12-05 23:14:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:14:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51521156] [2022-12-05 23:14:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:14:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:14:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:14:42,325 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-05 23:14:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:14:42,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51521156] [2022-12-05 23:14:42,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51521156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:14:42,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:14:42,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:14:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688345545] [2022-12-05 23:14:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:14:42,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:14:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:14:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:14:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:14:42,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 23:14:42,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 13 transitions, 97 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-05 23:14:42,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:14:42,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 23:14:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:14:42,340 INFO L130 PetriNetUnfolder]: 5/20 cut-off events. [2022-12-05 23:14:42,340 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-05 23:14:42,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 20 events. 5/20 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 24 event pairs, 2 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 92. Up to 11 conditions per place. [2022-12-05 23:14:42,340 INFO L137 encePairwiseOnDemand]: 6/13 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2022-12-05 23:14:42,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 14 transitions, 115 flow [2022-12-05 23:14:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:14:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:14:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-05 23:14:42,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-05 23:14:42,341 INFO L175 Difference]: Start difference. First operand has 33 places, 13 transitions, 97 flow. Second operand 5 states and 15 transitions. [2022-12-05 23:14:42,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 14 transitions, 115 flow [2022-12-05 23:14:42,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 14 transitions, 89 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-05 23:14:42,342 INFO L231 Difference]: Finished difference. Result has 29 places, 0 transitions, 0 flow [2022-12-05 23:14:42,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=29, PETRI_TRANSITIONS=0} [2022-12-05 23:14:42,342 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-05 23:14:42,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:14:42,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 0 transitions, 0 flow [2022-12-05 23:14:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:14:42,343 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:14:42,343 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:14:42,343 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-05 23:14:42,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:14:42,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:14:42,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:14:42,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:14:42,344 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:14:42,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-05 23:14:42,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:14:42,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-05 23:14:42,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-05 23:14:42,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 23:14:42,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:14:42,346 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:14:42,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:14:42,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:14:42,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:14:42 BasicIcfg [2022-12-05 23:14:42,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:14:42,350 INFO L158 Benchmark]: Toolchain (without parser) took 5699.92ms. Allocated memory was 195.0MB in the beginning and 293.6MB in the end (delta: 98.6MB). Free memory was 170.6MB in the beginning and 179.4MB in the end (delta: -8.9MB). Peak memory consumption was 91.0MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,350 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory was 173.2MB in the beginning and 173.1MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:14:42,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.06ms. Allocated memory is still 195.0MB. Free memory was 170.6MB in the beginning and 147.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.15ms. Allocated memory is still 195.0MB. Free memory was 147.3MB in the beginning and 145.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,351 INFO L158 Benchmark]: Boogie Preprocessor took 20.38ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 143.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,351 INFO L158 Benchmark]: RCFGBuilder took 343.04ms. Allocated memory is still 195.0MB. Free memory was 143.6MB in the beginning and 130.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,351 INFO L158 Benchmark]: TraceAbstraction took 4873.90ms. Allocated memory was 195.0MB in the beginning and 293.6MB in the end (delta: 98.6MB). Free memory was 129.5MB in the beginning and 179.4MB in the end (delta: -49.9MB). Peak memory consumption was 50.1MB. Max. memory is 8.0GB. [2022-12-05 23:14:42,352 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.12ms. Allocated memory is still 195.0MB. Free memory was 173.2MB in the beginning and 173.1MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.06ms. Allocated memory is still 195.0MB. Free memory was 170.6MB in the beginning and 147.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.15ms. Allocated memory is still 195.0MB. Free memory was 147.3MB in the beginning and 145.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.38ms. Allocated memory is still 195.0MB. Free memory was 145.3MB in the beginning and 143.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.04ms. Allocated memory is still 195.0MB. Free memory was 143.6MB in the beginning and 130.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4873.90ms. Allocated memory was 195.0MB in the beginning and 293.6MB in the end (delta: 98.6MB). Free memory was 129.5MB in the beginning and 179.4MB in the end (delta: -49.9MB). Peak memory consumption was 50.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 79 PlacesBefore, 27 PlacesAfterwards, 70 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 761, independent: 722, independent conditional: 722, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 761, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 761, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 761, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 656, independent: 623, independent conditional: 0, independent unconditional: 623, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 656, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 761, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 942, Positive conditional cache size: 0, Positive unconditional cache size: 942, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 50, unknown conditional: 0, unknown unconditional: 50] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 22 TransitionsBefore, 22 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 5, independent unconditional: 31, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 36, independent conditional: 1, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 36, independent conditional: 1, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 1, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 41, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 48, Positive conditional cache size: 1, Positive unconditional cache size: 47, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 50, Positive conditional cache size: 1, Positive unconditional cache size: 49, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 33 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 26, 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: 32, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 32, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 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: 32, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 50, Positive conditional cache size: 1, Positive unconditional cache size: 49, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 37 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 17, 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: 23, independent: 17, independent conditional: 3, independent unconditional: 14, 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: 23, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 23, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 54, Positive conditional cache size: 1, Positive unconditional cache size: 53, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 25, independent conditional: 25, 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: 34, independent: 25, independent conditional: 8, independent unconditional: 17, 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: 34, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 34, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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.1s, 43 PlacesBefore, 43 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 42, independent unconditional: 70, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 130, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 76, Positive conditional cache size: 1, Positive unconditional cache size: 75, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 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: 12, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 82, Positive conditional cache size: 3, Positive unconditional cache size: 79, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 15 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, 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: 27, independent: 24, independent conditional: 11, independent unconditional: 13, 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: 27, independent: 24, independent conditional: 7, 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: 27, independent: 24, independent conditional: 7, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 27, independent: 18, independent conditional: 5, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 114, Positive conditional cache size: 5, Positive unconditional cache size: 109, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 33 PlacesAfterwards, 15 TransitionsBefore, 13 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 127, Positive cache size: 116, Positive conditional cache size: 5, Positive unconditional cache size: 111, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 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): 127, Positive cache size: 116, Positive conditional cache size: 5, Positive unconditional cache size: 111, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 108 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: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 10 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-05 23:14:42,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...