/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:23:40,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:23:40,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:23:40,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:23:40,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:23:40,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:23:40,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:23:40,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:23:40,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:23:40,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:23:40,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:23:40,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:23:40,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:23:40,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:23:40,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:23:40,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:23:40,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:23:40,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:23:40,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:23:40,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:23:40,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:23:40,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:23:40,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:23:40,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:23:40,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:23:40,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:23:40,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:23:40,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:23:40,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:23:40,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:23:40,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:23:40,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:23:40,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:23:40,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:23:40,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:23:40,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:23:40,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:23:40,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:23:40,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:23:40,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:23:40,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:23:40,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:23:40,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:23:40,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:23:40,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:23:40,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:23:40,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:23:40,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:23:40,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:23:40,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:23:40,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:23:40,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:23:40,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:23:40,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:23:40,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:23:40,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:23:40,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:23:40,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:23:40,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:23:40,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:23:40,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:23:40,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:23:40,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:23:40,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:23:40,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:23:40,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:23:40,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:23:40,489 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:23:40,489 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:23:40,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2022-12-06 07:23:41,484 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:23:41,684 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:23:41,684 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2022-12-06 07:23:41,690 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43edf6d59/fcee9568eb854b549199fa6006408aaf/FLAG9541c4043 [2022-12-06 07:23:41,703 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43edf6d59/fcee9568eb854b549199fa6006408aaf [2022-12-06 07:23:41,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:23:41,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:23:41,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:23:41,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:23:41,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:23:41,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:23:41" (1/1) ... [2022-12-06 07:23:41,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f55a1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:41, skipping insertion in model container [2022-12-06 07:23:41,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:23:41" (1/1) ... [2022-12-06 07:23:41,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:23:41,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:23:41,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:41,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:41,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12821,12834] [2022-12-06 07:23:41,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:23:41,991 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:23:42,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:23:42,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:23:42,039 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c[12821,12834] [2022-12-06 07:23:42,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:23:42,050 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:23:42,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42 WrapperNode [2022-12-06 07:23:42,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:23:42,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:23:42,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:23:42,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:23:42,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,184 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1522 [2022-12-06 07:23:42,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:23:42,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:23:42,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:23:42,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:23:42,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:23:42,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:23:42,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:23:42,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:23:42,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (1/1) ... [2022-12-06 07:23:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:23:42,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:23:42,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:23:42,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:23:42,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:23:42,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:23:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:23:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:23:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:23:42,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:23:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:23:42,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:23:42,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:23:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:23:42,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:23:42,592 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:23:42,593 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:23:43,632 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:23:44,655 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:23:44,655 INFO L302 CfgBuilder]: Removed 12 assume(true) statements. [2022-12-06 07:23:44,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:23:44 BoogieIcfgContainer [2022-12-06 07:23:44,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:23:44,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:23:44,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:23:44,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:23:44,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:23:41" (1/3) ... [2022-12-06 07:23:44,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5284e02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:23:44, skipping insertion in model container [2022-12-06 07:23:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:23:42" (2/3) ... [2022-12-06 07:23:44,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5284e02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:23:44, skipping insertion in model container [2022-12-06 07:23:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:23:44" (3/3) ... [2022-12-06 07:23:44,662 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2022-12-06 07:23:44,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:23:44,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:23:44,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:23:44,851 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:23:44,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 431 transitions, 878 flow [2022-12-06 07:23:44,976 INFO L130 PetriNetUnfolder]: 53/429 cut-off events. [2022-12-06 07:23:44,977 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:23:44,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 429 events. 53/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 502 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 359. Up to 7 conditions per place. [2022-12-06 07:23:44,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 431 transitions, 878 flow [2022-12-06 07:23:44,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 421 transitions, 854 flow [2022-12-06 07:23:44,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:23:44,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 421 transitions, 854 flow [2022-12-06 07:23:45,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 421 transitions, 854 flow [2022-12-06 07:23:45,056 INFO L130 PetriNetUnfolder]: 53/421 cut-off events. [2022-12-06 07:23:45,057 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:23:45,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 421 events. 53/421 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 506 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 359. Up to 7 conditions per place. [2022-12-06 07:23:45,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 421 transitions, 854 flow [2022-12-06 07:23:45,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 5828 [2022-12-06 07:24:27,153 INFO L203 LiptonReduction]: Total number of compositions: 376 [2022-12-06 07:24:27,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:24:27,174 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;@59bbe298, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:24:27,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:24:27,194 INFO L130 PetriNetUnfolder]: 16/38 cut-off events. [2022-12-06 07:24:27,194 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:27,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:27,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:27,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:27,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1640273470, now seen corresponding path program 1 times [2022-12-06 07:24:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:27,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482366101] [2022-12-06 07:24:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:27,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482366101] [2022-12-06 07:24:27,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482366101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:27,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:27,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555486493] [2022-12-06 07:24:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:27,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:24:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:24:27,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:24:27,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:24:27,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:27,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:27,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:24:27,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:27,963 INFO L130 PetriNetUnfolder]: 133/194 cut-off events. [2022-12-06 07:24:27,963 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:24:27,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 194 events. 133/194 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 358 event pairs, 45 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 308. Up to 193 conditions per place. [2022-12-06 07:24:27,967 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 37 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-06 07:24:27,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 176 flow [2022-12-06 07:24:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:24:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:24:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 07:24:27,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2022-12-06 07:24:27,976 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 90 flow. Second operand 3 states and 43 transitions. [2022-12-06 07:24:27,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 176 flow [2022-12-06 07:24:27,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:24:27,980 INFO L231 Difference]: Finished difference. Result has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:27,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=29, PETRI_TRANSITIONS=41} [2022-12-06 07:24:27,983 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-12-06 07:24:27,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:27,984 INFO L89 Accepts]: Start accepts. Operand has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:27,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:27,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:27,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:27,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:28,014 INFO L130 PetriNetUnfolder]: 16/41 cut-off events. [2022-12-06 07:24:28,014 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:24:28,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 41 events. 16/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2022-12-06 07:24:28,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:28,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:24:28,015 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:28,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:24:28,017 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 41 transitions, 104 flow [2022-12-06 07:24:28,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:28,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:28,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:28,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:24:28,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1708896424, now seen corresponding path program 1 times [2022-12-06 07:24:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875098442] [2022-12-06 07:24:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:24:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875098442] [2022-12-06 07:24:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875098442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:28,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525384581] [2022-12-06 07:24:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:24:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:24:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:24:28,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:24:28,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:28,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:28,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:24:28,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:28,407 INFO L130 PetriNetUnfolder]: 133/198 cut-off events. [2022-12-06 07:24:28,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:24:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 198 events. 133/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 358 event pairs, 45 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 393. Up to 195 conditions per place. [2022-12-06 07:24:28,409 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-06 07:24:28,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 202 flow [2022-12-06 07:24:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:24:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:24:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:24:28,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2022-12-06 07:24:28,410 INFO L175 Difference]: Start difference. First operand has 29 places, 41 transitions, 104 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:24:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 202 flow [2022-12-06 07:24:28,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:28,411 INFO L231 Difference]: Finished difference. Result has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=31, PETRI_TRANSITIONS=45} [2022-12-06 07:24:28,412 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 07:24:28,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:28,412 INFO L89 Accepts]: Start accepts. Operand has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,413 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:28,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:28,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,431 INFO L130 PetriNetUnfolder]: 16/45 cut-off events. [2022-12-06 07:24:28,431 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:24:28,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 45 events. 16/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2022-12-06 07:24:28,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:24:28,432 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:28,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:24:28,433 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 45 transitions, 142 flow [2022-12-06 07:24:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:28,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:28,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:28,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:24:28,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash -118114530, now seen corresponding path program 1 times [2022-12-06 07:24:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:28,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884994632] [2022-12-06 07:24:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 07:24:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:28,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884994632] [2022-12-06 07:24:28,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884994632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:24:28,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034609106] [2022-12-06 07:24:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:28,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:28,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:24:28,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:24:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:29,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:24:29,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:24:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 07:24:29,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:24:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 07:24:29,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034609106] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:24:29,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:24:29,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 07:24:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108293229] [2022-12-06 07:24:29,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:29,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:24:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:24:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:24:29,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:24:29,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 45 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:29,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:29,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:24:29,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:29,402 INFO L130 PetriNetUnfolder]: 133/216 cut-off events. [2022-12-06 07:24:29,403 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:24:29,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 216 events. 133/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 358 event pairs, 45 based on Foata normal form. 6/138 useless extension candidates. Maximal degree in co-relation 431. Up to 193 conditions per place. [2022-12-06 07:24:29,404 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 31 selfloop transitions, 32 changer transitions 0/63 dead transitions. [2022-12-06 07:24:29,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 63 transitions, 324 flow [2022-12-06 07:24:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:24:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:24:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-06 07:24:29,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25961538461538464 [2022-12-06 07:24:29,405 INFO L175 Difference]: Start difference. First operand has 31 places, 45 transitions, 142 flow. Second operand 8 states and 81 transitions. [2022-12-06 07:24:29,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 63 transitions, 324 flow [2022-12-06 07:24:29,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 63 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:29,407 INFO L231 Difference]: Finished difference. Result has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=41, PETRI_TRANSITIONS=63} [2022-12-06 07:24:29,408 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 07:24:29,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:29,408 INFO L89 Accepts]: Start accepts. Operand has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:29,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:29,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,429 INFO L130 PetriNetUnfolder]: 16/63 cut-off events. [2022-12-06 07:24:29,429 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:24:29,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 63 events. 16/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 115. Up to 14 conditions per place. [2022-12-06 07:24:29,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:24:29,430 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:29,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 07:24:29,431 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 63 transitions, 318 flow [2022-12-06 07:24:29,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:29,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:29,431 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:29,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:24:29,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:29,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1131414096, now seen corresponding path program 1 times [2022-12-06 07:24:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:29,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075824875] [2022-12-06 07:24:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-06 07:24:29,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075824875] [2022-12-06 07:24:29,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075824875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:24:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902549138] [2022-12-06 07:24:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:29,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:29,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:29,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:24:29,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:24:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:30,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:24:30,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:24:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-06 07:24:30,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:24:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-06 07:24:30,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902549138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:24:30,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:24:30,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 07:24:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089447377] [2022-12-06 07:24:30,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:30,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:24:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:30,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:24:30,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:24:30,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:24:30,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 63 transitions, 318 flow. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:30,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:30,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:24:30,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:30,828 INFO L130 PetriNetUnfolder]: 133/228 cut-off events. [2022-12-06 07:24:30,828 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 07:24:30,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 228 events. 133/228 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 358 event pairs, 45 based on Foata normal form. 11/158 useless extension candidates. Maximal degree in co-relation 512. Up to 193 conditions per place. [2022-12-06 07:24:30,829 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 31 selfloop transitions, 44 changer transitions 0/75 dead transitions. [2022-12-06 07:24:30,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 536 flow [2022-12-06 07:24:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:24:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:24:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2022-12-06 07:24:30,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13942307692307693 [2022-12-06 07:24:30,831 INFO L175 Difference]: Start difference. First operand has 41 places, 63 transitions, 318 flow. Second operand 16 states and 87 transitions. [2022-12-06 07:24:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 536 flow [2022-12-06 07:24:30,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 498 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:30,834 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=462, PETRI_PLACES=56, PETRI_TRANSITIONS=75} [2022-12-06 07:24:30,834 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 07:24:30,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:30,834 INFO L89 Accepts]: Start accepts. Operand has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:30,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:30,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,858 INFO L130 PetriNetUnfolder]: 16/75 cut-off events. [2022-12-06 07:24:30,859 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:24:30,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 75 events. 16/75 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 183. Up to 22 conditions per place. [2022-12-06 07:24:30,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:24:30,860 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:30,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 07:24:30,860 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 462 flow [2022-12-06 07:24:30,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:30,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:30,861 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:30,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:24:31,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 07:24:31,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 925834901, now seen corresponding path program 2 times [2022-12-06 07:24:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:31,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433792687] [2022-12-06 07:24:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-06 07:24:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433792687] [2022-12-06 07:24:31,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433792687] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:24:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162616470] [2022-12-06 07:24:31,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:24:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:31,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:24:31,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:24:31,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:24:31,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:24:31,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:24:31,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:24:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:24:33,306 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 07:24:33,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 450 treesize of output 399 [2022-12-06 07:24:34,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:24:34,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1369 treesize of output 1195 [2022-12-06 07:24:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-12-06 07:24:58,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:24:58,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162616470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:58,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:24:58,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 18 [2022-12-06 07:24:58,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354168876] [2022-12-06 07:24:58,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:58,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:24:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:24:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:24:58,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:24:58,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 462 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:58,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:24:58,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,994 INFO L130 PetriNetUnfolder]: 220/360 cut-off events. [2022-12-06 07:24:59,994 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 07:24:59,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 360 events. 220/360 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 867 event pairs, 22 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 820. Up to 209 conditions per place. [2022-12-06 07:24:59,997 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 89 selfloop transitions, 12 changer transitions 7/108 dead transitions. [2022-12-06 07:24:59,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 750 flow [2022-12-06 07:24:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 07:25:00,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2022-12-06 07:25:00,001 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 462 flow. Second operand 6 states and 75 transitions. [2022-12-06 07:25:00,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 750 flow [2022-12-06 07:25:00,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 636 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-06 07:25:00,007 INFO L231 Difference]: Finished difference. Result has 56 places, 85 transitions, 431 flow [2022-12-06 07:25:00,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=56, PETRI_TRANSITIONS=85} [2022-12-06 07:25:00,008 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 07:25:00,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:00,008 INFO L89 Accepts]: Start accepts. Operand has 56 places, 85 transitions, 431 flow [2022-12-06 07:25:00,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:00,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:00,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 85 transitions, 431 flow [2022-12-06 07:25:00,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 85 transitions, 431 flow [2022-12-06 07:25:00,092 INFO L130 PetriNetUnfolder]: 67/153 cut-off events. [2022-12-06 07:25:00,092 INFO L131 PetriNetUnfolder]: For 21/28 co-relation queries the response was YES. [2022-12-06 07:25:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 153 events. 67/153 cut-off events. For 21/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 236 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 346. Up to 76 conditions per place. [2022-12-06 07:25:00,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 85 transitions, 431 flow [2022-12-06 07:25:00,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 07:25:00,095 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:00,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:25:00,096 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 85 transitions, 431 flow [2022-12-06 07:25:00,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:00,096 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:00,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1345125183, now seen corresponding path program 3 times [2022-12-06 07:25:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:00,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860215727] [2022-12-06 07:25:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-06 07:25:00,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:00,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860215727] [2022-12-06 07:25:00,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860215727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:00,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895692255] [2022-12-06 07:25:00,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:25:00,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:00,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:00,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:00,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:25:01,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 07:25:01,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:25:01,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:25:01,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:02,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:25:02,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1356 treesize of output 1182 [2022-12-06 07:25:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-12-06 07:25:58,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:25:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895692255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:25:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2022-12-06 07:25:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408601451] [2022-12-06 07:25:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:25:58,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:25:58,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 85 transitions, 431 flow. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:58,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:25:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,034 INFO L130 PetriNetUnfolder]: 222/374 cut-off events. [2022-12-06 07:25:59,034 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-06 07:25:59,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 374 events. 222/374 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 970 event pairs, 24 based on Foata normal form. 3/269 useless extension candidates. Maximal degree in co-relation 1144. Up to 242 conditions per place. [2022-12-06 07:25:59,036 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 89 selfloop transitions, 12 changer transitions 5/106 dead transitions. [2022-12-06 07:25:59,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 707 flow [2022-12-06 07:25:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 07:25:59,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-06 07:25:59,037 INFO L175 Difference]: Start difference. First operand has 55 places, 85 transitions, 431 flow. Second operand 5 states and 73 transitions. [2022-12-06 07:25:59,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 707 flow [2022-12-06 07:25:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 702 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:59,040 INFO L231 Difference]: Finished difference. Result has 59 places, 85 transitions, 462 flow [2022-12-06 07:25:59,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=59, PETRI_TRANSITIONS=85} [2022-12-06 07:25:59,040 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-06 07:25:59,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,041 INFO L89 Accepts]: Start accepts. Operand has 59 places, 85 transitions, 462 flow [2022-12-06 07:25:59,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 85 transitions, 462 flow [2022-12-06 07:25:59,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 85 transitions, 462 flow [2022-12-06 07:25:59,139 INFO L130 PetriNetUnfolder]: 69/159 cut-off events. [2022-12-06 07:25:59,139 INFO L131 PetriNetUnfolder]: For 71/116 co-relation queries the response was YES. [2022-12-06 07:25:59,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 159 events. 69/159 cut-off events. For 71/116 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 270 event pairs, 0 based on Foata normal form. 2/113 useless extension candidates. Maximal degree in co-relation 382. Up to 82 conditions per place. [2022-12-06 07:25:59,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 85 transitions, 462 flow [2022-12-06 07:25:59,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 07:25:59,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-06 07:25:59,340 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 85 transitions, 462 flow [2022-12-06 07:25:59,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:59,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,341 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:25:59,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:59,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1510930424, now seen corresponding path program 1 times [2022-12-06 07:25:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557351472] [2022-12-06 07:25:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-06 07:25:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557351472] [2022-12-06 07:25:59,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557351472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671423145] [2022-12-06 07:25:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:59,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:59,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:26:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:26:00,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-06 07:26:00,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:26:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-06 07:26:00,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671423145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:26:00,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:26:00,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 07:26:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401370756] [2022-12-06 07:26:00,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:26:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:26:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2022-12-06 07:26:00,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:26:00,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 85 transitions, 462 flow. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:00,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:26:00,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,031 INFO L130 PetriNetUnfolder]: 226/397 cut-off events. [2022-12-06 07:26:01,031 INFO L131 PetriNetUnfolder]: For 335/335 co-relation queries the response was YES. [2022-12-06 07:26:01,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 397 events. 226/397 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 961 event pairs, 80 based on Foata normal form. 14/299 useless extension candidates. Maximal degree in co-relation 1335. Up to 348 conditions per place. [2022-12-06 07:26:01,035 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 41 selfloop transitions, 58 changer transitions 0/99 dead transitions. [2022-12-06 07:26:01,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 744 flow [2022-12-06 07:26:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:26:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:26:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-12-06 07:26:01,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18864468864468864 [2022-12-06 07:26:01,036 INFO L175 Difference]: Start difference. First operand has 59 places, 85 transitions, 462 flow. Second operand 14 states and 103 transitions. [2022-12-06 07:26:01,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 744 flow [2022-12-06 07:26:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 731 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:01,040 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=747, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2022-12-06 07:26:01,041 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2022-12-06 07:26:01,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,041 INFO L89 Accepts]: Start accepts. Operand has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,143 INFO L130 PetriNetUnfolder]: 70/181 cut-off events. [2022-12-06 07:26:01,144 INFO L131 PetriNetUnfolder]: For 117/162 co-relation queries the response was YES. [2022-12-06 07:26:01,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 181 events. 70/181 cut-off events. For 117/162 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 329 event pairs, 0 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 484. Up to 86 conditions per place. [2022-12-06 07:26:01,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 07:26:01,146 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:01,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 07:26:01,146 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 747 flow [2022-12-06 07:26:01,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,146 INFO L213 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:26:01,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:01,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1847496726, now seen corresponding path program 1 times [2022-12-06 07:26:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117689590] [2022-12-06 07:26:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-12-06 07:26:01,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117689590] [2022-12-06 07:26:01,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117689590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210455716] [2022-12-06 07:26:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:01,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:01,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:26:01,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:01,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:26:01,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,984 INFO L130 PetriNetUnfolder]: 255/454 cut-off events. [2022-12-06 07:26:01,984 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-06 07:26:01,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 454 events. 255/454 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1304 event pairs, 50 based on Foata normal form. 14/342 useless extension candidates. Maximal degree in co-relation 1551. Up to 291 conditions per place. [2022-12-06 07:26:01,986 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 117 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2022-12-06 07:26:01,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 1072 flow [2022-12-06 07:26:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 07:26:01,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2022-12-06 07:26:01,988 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 747 flow. Second operand 3 states and 58 transitions. [2022-12-06 07:26:01,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 1072 flow [2022-12-06 07:26:01,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 120 transitions, 1012 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 07:26:01,996 INFO L231 Difference]: Finished difference. Result has 76 places, 102 transitions, 727 flow [2022-12-06 07:26:01,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=727, PETRI_PLACES=76, PETRI_TRANSITIONS=102} [2022-12-06 07:26:01,998 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 07:26:01,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,998 INFO L89 Accepts]: Start accepts. Operand has 76 places, 102 transitions, 727 flow [2022-12-06 07:26:02,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 102 transitions, 727 flow [2022-12-06 07:26:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 727 flow [2022-12-06 07:26:02,105 INFO L130 PetriNetUnfolder]: 85/223 cut-off events. [2022-12-06 07:26:02,106 INFO L131 PetriNetUnfolder]: For 186/193 co-relation queries the response was YES. [2022-12-06 07:26:02,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 223 events. 85/223 cut-off events. For 186/193 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 562 event pairs, 3 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 589. Up to 105 conditions per place. [2022-12-06 07:26:02,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 727 flow [2022-12-06 07:26:02,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 07:26:02,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [4823] $Ultimate##0-->L145: Formula: (let ((.cse0 (select (select |v_#memory_int_1667| v_~index_of_4~0.base_469) (+ 16 v_~index_of_4~0.offset_469)))) (and (= (select (select |v_#memory_int_1667| v_~index_of_0~0.base_459) (+ v_~index_of_0~0.offset_459 16)) .cse0) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet156#1_46| 256) 0)) (= (ite |v_thread2_#t~short162#1_64| 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= v_~i1_14~0_149 0) (not (= (+ .cse0 1) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) |v_thread2_#t~short159#1_55| |v_thread2_#t~short159#1_56| (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= v_~break_15~0_71 0) |v_thread2_#t~short162#1_63|)) InVars {~index_of_4~0.base=v_~index_of_4~0.base_469, #memory_int=|v_#memory_int_1667|, ~index_of_0~0.base=v_~index_of_0~0.base_459, ~index_of_0~0.offset=v_~index_of_0~0.offset_459, ~index_of_4~0.offset=v_~index_of_4~0.offset_469, thread2Thread1of1ForFork1_#t~nondet156#1=|v_thread2Thread1of1ForFork1_#t~nondet156#1_46|} OutVars{thread2Thread1of1ForFork1_#t~mem160#1=|v_thread2Thread1of1ForFork1_#t~mem160#1_9|, ~index_of_4~0.base=v_~index_of_4~0.base_469, ~break_15~0=v_~break_15~0_71, thread2Thread1of1ForFork1_#t~short159#1=|v_thread2Thread1of1ForFork1_#t~short159#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem157#1=|v_thread2Thread1of1ForFork1_#t~mem157#1_7|, ~i1_14~0=v_~i1_14~0_149, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread2Thread1of1ForFork1_#t~mem161#1=|v_thread2Thread1of1ForFork1_#t~mem161#1_9|, #memory_int=|v_#memory_int_1667|, ~index_of_0~0.base=v_~index_of_0~0.base_459, ~index_of_0~0.offset=v_~index_of_0~0.offset_459, ~index_of_4~0.offset=v_~index_of_4~0.offset_469, thread2Thread1of1ForFork1_#t~short162#1=|v_thread2Thread1of1ForFork1_#t~short162#1_7|, thread2Thread1of1ForFork1_#t~mem158#1=|v_thread2Thread1of1ForFork1_#t~mem158#1_9|} AuxVars[|v_thread2_#t~short159#1_55|, |v_thread2_#t~short162#1_63|, |v_thread2_#t~short162#1_64|, |v_thread2_#t~short159#1_56|] AssignedVars[~i1_14~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem161#1, thread2Thread1of1ForFork1_#t~mem160#1, ~break_15~0, thread2Thread1of1ForFork1_#t~short159#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem157#1, thread2Thread1of1ForFork1_#t~short162#1, thread2Thread1of1ForFork1_#t~mem158#1, thread2Thread1of1ForFork1_#t~nondet156#1] and [4864] L229-4-->L230-3: Formula: (and (= (store |v_#memory_int_1686| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_1686| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre321#1_33|)) |v_#memory_int_1685|) (= |v_ULTIMATE.start_main_#t~pre321#1_33| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_1686|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#t~nondet320#1=|v_ULTIMATE.start_main_#t~nondet320#1_11|, ULTIMATE.start_main_#t~pre319#1=|v_ULTIMATE.start_main_#t~pre319#1_13|, #memory_int=|v_#memory_int_1685|, ULTIMATE.start_main_#t~pre321#1=|v_ULTIMATE.start_main_#t~pre321#1_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet320#1, ULTIMATE.start_main_#t~pre319#1, #memory_int, ULTIMATE.start_main_#t~pre321#1] [2022-12-06 07:26:02,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 07:26:02,231 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 729 flow [2022-12-06 07:26:02,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:02,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,231 INFO L213 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:26:02,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1316073821, now seen corresponding path program 2 times [2022-12-06 07:26:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769140752] [2022-12-06 07:26:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-06 07:26:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769140752] [2022-12-06 07:26:02,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769140752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575187648] [2022-12-06 07:26:02,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:26:02,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:02,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:02,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:02,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:26:03,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 07:26:03,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:26:03,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:26:03,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:04,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:04,068 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 07:26:04,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 117 [2022-12-06 07:26:04,574 INFO L321 Elim1Store]: treesize reduction 348, result has 0.3 percent of original size [2022-12-06 07:26:04,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 662 treesize of output 446 [2022-12-06 07:26:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-12-06 07:26:04,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:26:04,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575187648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:26:04,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 25 [2022-12-06 07:26:04,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237296745] [2022-12-06 07:26:04,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:26:04,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:26:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2022-12-06 07:26:04,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:26:04,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 729 flow. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:04,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:26:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,267 INFO L130 PetriNetUnfolder]: 217/424 cut-off events. [2022-12-06 07:26:05,267 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2022-12-06 07:26:05,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 424 events. 217/424 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1322 event pairs, 21 based on Foata normal form. 18/344 useless extension candidates. Maximal degree in co-relation 1444. Up to 217 conditions per place. [2022-12-06 07:26:05,269 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 122 selfloop transitions, 12 changer transitions 1/135 dead transitions. [2022-12-06 07:26:05,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1116 flow [2022-12-06 07:26:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:26:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:26:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 07:26:05,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-06 07:26:05,270 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 729 flow. Second operand 5 states and 74 transitions. [2022-12-06 07:26:05,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1116 flow [2022-12-06 07:26:05,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 135 transitions, 1106 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:05,275 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 784 flow [2022-12-06 07:26:05,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2022-12-06 07:26:05,276 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 07:26:05,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,276 INFO L89 Accepts]: Start accepts. Operand has 81 places, 106 transitions, 784 flow [2022-12-06 07:26:05,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 106 transitions, 784 flow [2022-12-06 07:26:05,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 106 transitions, 784 flow [2022-12-06 07:26:05,361 INFO L130 PetriNetUnfolder]: 68/202 cut-off events. [2022-12-06 07:26:05,361 INFO L131 PetriNetUnfolder]: For 251/260 co-relation queries the response was YES. [2022-12-06 07:26:05,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 202 events. 68/202 cut-off events. For 251/260 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 508 event pairs, 1 based on Foata normal form. 1/171 useless extension candidates. Maximal degree in co-relation 588. Up to 92 conditions per place. [2022-12-06 07:26:05,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 106 transitions, 784 flow [2022-12-06 07:26:05,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 07:26:05,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [5048] $Ultimate##0-->L172: Formula: (let ((.cse0 (select (select |v_#memory_int_1827| v_~count_occurrences_of_6~0.base_353) (+ 12 v_~count_occurrences_of_6~0.offset_353))) (.cse1 (select |v_#memory_int_1827| v_~index_of_4~0.base_553)) (.cse2 (select |v_#memory_int_1827| v_~index_of_0~0.base_547)) (.cse3 (select (select |v_#memory_int_1827| v_~count_occurrences_of_2~0.base_361) (+ v_~count_occurrences_of_2~0.offset_361 12)))) (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet200#1_66| 256) 0)) (= (mod |v_thread2Thread1of1ForFork1_#t~nondet156#1_82| 256) 0) (or (and (= |v_thread2_#t~short207#1_97| |v_thread2Thread1of1ForFork1_#t~short207#1_10|) (= |v_thread2_#t~mem206#1_66| |v_thread2Thread1of1ForFork1_#t~mem206#1_10|) (= |v_thread2_#t~short208#1_75| |v_thread2_#t~short208#1_76|) (= |v_thread2_#t~mem205#1_60| |v_thread2Thread1of1ForFork1_#t~mem205#1_10|)) (and (= |v_thread2_#t~mem205#1_60| 1) (= |v_thread2_#t~mem205#1_60| .cse0) |v_thread2_#t~short207#1_98| |v_thread2_#t~short207#1_97| (= |v_thread2_#t~mem206#1_66| (select .cse1 (+ 8 v_~index_of_4~0.offset_553))) (not (= (+ |v_thread2_#t~mem206#1_66| 1) 0)))) (not (= (ite (not |v_thread2_#t~short203#1_65|) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= (+ (select .cse2 (+ v_~index_of_0~0.offset_547 16)) 1) 0) (= 0 v_~break_17~0_111) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (or (not |v_thread2_#t~short208#1_76|) (< 1 .cse0)) (= (mod |v_thread2Thread1of1ForFork1_#t~nondet190#1_92| 256) 0) (not (= (ite |v_thread2_#t~short213#1_94| 1 0) 0)) (not |v_thread2_#t~short203#1_66|) (not (= (ite |v_thread2_#t~short208#1_75| 1 0) 0)) (= (+ (select .cse1 (+ 16 v_~index_of_4~0.offset_553)) 1) 0) (or (and (= |v_thread2_#t~short212#1_97| |v_thread2Thread1of1ForFork1_#t~short212#1_10|) |v_thread2_#t~short213#1_93| (= |v_thread2_#t~mem210#1_60| |v_thread2Thread1of1ForFork1_#t~mem210#1_10|) (= |v_thread2_#t~mem211#1_66| |v_thread2Thread1of1ForFork1_#t~mem211#1_10|)) (and |v_thread2_#t~short212#1_97| |v_thread2_#t~short212#1_98| (= |v_thread2_#t~mem210#1_60| 1) (not (= (+ |v_thread2_#t~mem211#1_66| 1) 0)) (= .cse3 |v_thread2_#t~mem210#1_60|) (= |v_thread2_#t~mem211#1_66| (select .cse2 (+ v_~index_of_0~0.offset_547 8))))) (= v_~i2_16~0_187 0) (or (not |v_thread2_#t~short213#1_93|) (< 1 .cse3)) (= (ite (= (select (select |v_#memory_int_1827| v_~last_index_of_7~0.base_277) (+ v_~last_index_of_7~0.offset_277 12)) (select (select |v_#memory_int_1827| v_~last_index_of_3~0.base_271) (+ 12 v_~last_index_of_3~0.offset_271))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|))) InVars {~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_361, ~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_353, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_271, ~index_of_4~0.base=v_~index_of_4~0.base_553, thread2Thread1of1ForFork1_#t~mem205#1=|v_thread2Thread1of1ForFork1_#t~mem205#1_10|, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_271, thread2Thread1of1ForFork1_#t~mem211#1=|v_thread2Thread1of1ForFork1_#t~mem211#1_10|, thread2Thread1of1ForFork1_#t~nondet156#1=|v_thread2Thread1of1ForFork1_#t~nondet156#1_82|, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_361, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_277, thread2Thread1of1ForFork1_#t~mem206#1=|v_thread2Thread1of1ForFork1_#t~mem206#1_10|, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_353, thread2Thread1of1ForFork1_#t~short207#1=|v_thread2Thread1of1ForFork1_#t~short207#1_10|, #memory_int=|v_#memory_int_1827|, thread2Thread1of1ForFork1_#t~nondet200#1=|v_thread2Thread1of1ForFork1_#t~nondet200#1_66|, thread2Thread1of1ForFork1_#t~nondet190#1=|v_thread2Thread1of1ForFork1_#t~nondet190#1_92|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_277, ~index_of_0~0.offset=v_~index_of_0~0.offset_547, ~index_of_0~0.base=v_~index_of_0~0.base_547, ~index_of_4~0.offset=v_~index_of_4~0.offset_553, thread2Thread1of1ForFork1_#t~short212#1=|v_thread2Thread1of1ForFork1_#t~short212#1_10|, thread2Thread1of1ForFork1_#t~mem210#1=|v_thread2Thread1of1ForFork1_#t~mem210#1_10|} OutVars{thread2Thread1of1ForFork1_#t~short203#1=|v_thread2Thread1of1ForFork1_#t~short203#1_7|, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_271, thread2Thread1of1ForFork1_#t~short208#1=|v_thread2Thread1of1ForFork1_#t~short208#1_7|, ~index_of_4~0.base=v_~index_of_4~0.base_553, thread2Thread1of1ForFork1_#t~mem215#1=|v_thread2Thread1of1ForFork1_#t~mem215#1_7|, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_271, thread2Thread1of1ForFork1_#t~mem202#1=|v_thread2Thread1of1ForFork1_#t~mem202#1_9|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~break_17~0=v_~break_17~0_111, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_361, thread2Thread1of1ForFork1_#t~mem204#1=|v_thread2Thread1of1ForFork1_#t~mem204#1_7|, ~i2_16~0=v_~i2_16~0_187, ~index_of_0~0.offset=v_~index_of_0~0.offset_547, ~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_361, ~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_353, thread2Thread1of1ForFork1_#t~mem209#1=|v_thread2Thread1of1ForFork1_#t~mem209#1_7|, thread2Thread1of1ForFork1_#t~short213#1=|v_thread2Thread1of1ForFork1_#t~short213#1_7|, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_277, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork1_#t~mem201#1=|v_thread2Thread1of1ForFork1_#t~mem201#1_7|, thread2Thread1of1ForFork1_#t~mem214#1=|v_thread2Thread1of1ForFork1_#t~mem214#1_7|, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_353, #memory_int=|v_#memory_int_1827|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_277, ~index_of_0~0.base=v_~index_of_0~0.base_547, ~index_of_4~0.offset=v_~index_of_4~0.offset_553} AuxVars[|v_thread2_#t~mem210#1_60|, |v_thread2_#t~short207#1_97|, |v_thread2_#t~short207#1_98|, |v_thread2_#t~short212#1_98|, |v_thread2_#t~short212#1_97|, |v_thread2_#t~mem206#1_66|, |v_thread2_#t~mem211#1_66|, |v_thread2_#t~short213#1_93|, |v_thread2_#t~short213#1_94|, |v_thread2_#t~mem205#1_60|, |v_thread2_#t~short208#1_75|, |v_thread2_#t~short208#1_76|, |v_thread2_#t~short203#1_65|, |v_thread2_#t~short203#1_66|] AssignedVars[thread2Thread1of1ForFork1_#t~short203#1, thread2Thread1of1ForFork1_#t~short208#1, thread2Thread1of1ForFork1_#t~mem215#1, thread2Thread1of1ForFork1_#t~mem205#1, thread2Thread1of1ForFork1_#t~mem202#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem211#1, thread2Thread1of1ForFork1_#t~mem209#1, thread2Thread1of1ForFork1_#t~short213#1, ~break_17~0, thread2Thread1of1ForFork1_#t~nondet156#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem201#1, thread2Thread1of1ForFork1_#t~mem214#1, thread2Thread1of1ForFork1_#t~mem206#1, thread2Thread1of1ForFork1_#t~short207#1, thread2Thread1of1ForFork1_#t~mem204#1, ~i2_16~0, thread2Thread1of1ForFork1_#t~nondet200#1, thread2Thread1of1ForFork1_#t~nondet190#1, thread2Thread1of1ForFork1_#t~short212#1, thread2Thread1of1ForFork1_#t~mem210#1] and [5033] $Ultimate##0-->L88: Formula: (let ((.cse0 (select |v_#memory_int_1805| v_~index_of_4~0.base_545)) (.cse1 (select (select |v_#memory_int_1805| v_~count_occurrences_of_6~0.base_345) (+ 12 v_~count_occurrences_of_6~0.offset_345))) (.cse3 (select (select |v_#memory_int_1805| v_~count_occurrences_of_2~0.base_353) (+ v_~count_occurrences_of_2~0.offset_353 12))) (.cse2 (select |v_#memory_int_1805| v_~index_of_0~0.base_539))) (and (= (+ (select .cse0 (+ 16 v_~index_of_4~0.offset_545)) 1) 0) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet45#1_62| 256) 0)) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem56#1_18| |v_thread1_#t~mem56#1_56|) (= |v_thread1_#t~short57#1_86| |v_thread1Thread1of1ForFork0_#t~short57#1_18|) (= |v_thread1Thread1of1ForFork0_#t~mem55#1_18| |v_thread1_#t~mem55#1_52|) (= |v_thread1_#t~short58#1_88| |v_thread1_#t~short58#1_87|)) (and (= |v_thread1_#t~mem55#1_52| 1) |v_thread1_#t~short57#1_85| |v_thread1_#t~short57#1_86| (= (select .cse0 (+ 8 v_~index_of_4~0.offset_545)) |v_thread1_#t~mem56#1_56|) (= |v_thread1_#t~mem55#1_52| .cse1) (not (= (+ |v_thread1_#t~mem56#1_56| 1) 0)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|) (= (+ (select .cse2 (+ v_~index_of_0~0.offset_539 16)) 1) 0) (= (mod |v_thread1Thread1of1ForFork0_#t~nondet35#1_54| 256) 0) (or (not |v_thread1_#t~short58#1_88|) (< 1 .cse1)) (or (not |v_thread1_#t~short53#1_97|) (< 1 .cse3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_107| 0)) (not (= (ite |v_thread1_#t~short53#1_98| 1 0) 0)) (= 0 (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_42| 256)) (not (= (ite (not |v_thread1_#t~short48#1_84|) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (= (select (select |v_#memory_int_1805| v_~last_index_of_7~0.base_273) (+ v_~last_index_of_7~0.offset_273 12)) (select (select |v_#memory_int_1805| v_~last_index_of_3~0.base_267) (+ 12 v_~last_index_of_3~0.offset_267))) 1 0)) (= v_~break_12~0_101 0) (or (and (= |v_thread1_#t~mem50#1_70| .cse3) (= |v_thread1_#t~mem50#1_70| 1) (not (= (+ |v_thread1_#t~mem51#1_76| 1) 0)) (= (select .cse2 (+ v_~index_of_0~0.offset_539 8)) |v_thread1_#t~mem51#1_76|) |v_thread1_#t~short52#1_107| |v_thread1_#t~short52#1_108|) (and (= |v_thread1Thread1of1ForFork0_#t~mem50#1_18| |v_thread1_#t~mem50#1_70|) |v_thread1_#t~short53#1_97| (= |v_thread1Thread1of1ForFork0_#t~short52#1_18| |v_thread1_#t~short52#1_107|) (= |v_thread1Thread1of1ForFork0_#t~mem51#1_18| |v_thread1_#t~mem51#1_76|))) (not (= (ite |v_thread1_#t~short58#1_87| 1 0) 0)) (= v_~i2_11~0_195 0) (not |v_thread1_#t~short48#1_83|))) InVars {~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_345, ~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_353, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_267, thread1Thread1of1ForFork0_#t~short57#1=|v_thread1Thread1of1ForFork0_#t~short57#1_18|, ~index_of_4~0.base=v_~index_of_4~0.base_545, thread1Thread1of1ForFork0_#t~nondet45#1=|v_thread1Thread1of1ForFork0_#t~nondet45#1_62|, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_267, thread1Thread1of1ForFork0_#t~short52#1=|v_thread1Thread1of1ForFork0_#t~short52#1_18|, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_353, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_273, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_345, thread1Thread1of1ForFork0_#t~mem51#1=|v_thread1Thread1of1ForFork0_#t~mem51#1_18|, thread1Thread1of1ForFork0_#t~mem56#1=|v_thread1Thread1of1ForFork0_#t~mem56#1_18|, thread1Thread1of1ForFork0_#t~nondet35#1=|v_thread1Thread1of1ForFork0_#t~nondet35#1_54|, #memory_int=|v_#memory_int_1805|, thread1Thread1of1ForFork0_#t~mem55#1=|v_thread1Thread1of1ForFork0_#t~mem55#1_18|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_273, ~index_of_0~0.offset=v_~index_of_0~0.offset_539, ~index_of_0~0.base=v_~index_of_0~0.base_539, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_42|, ~index_of_4~0.offset=v_~index_of_4~0.offset_545, thread1Thread1of1ForFork0_#t~mem50#1=|v_thread1Thread1of1ForFork0_#t~mem50#1_18|} OutVars{thread1Thread1of1ForFork0_#t~mem46#1=|v_thread1Thread1of1ForFork0_#t~mem46#1_11|, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_267, thread1Thread1of1ForFork0_#t~mem59#1=|v_thread1Thread1of1ForFork0_#t~mem59#1_11|, ~index_of_4~0.base=v_~index_of_4~0.base_545, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_267, thread1Thread1of1ForFork0_#t~mem54#1=|v_thread1Thread1of1ForFork0_#t~mem54#1_11|, thread1Thread1of1ForFork0_#t~mem47#1=|v_thread1Thread1of1ForFork0_#t~mem47#1_13|, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_353, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_107|, ~index_of_0~0.offset=v_~index_of_0~0.offset_539, ~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_345, ~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_353, thread1Thread1of1ForFork0_#t~short48#1=|v_thread1Thread1of1ForFork0_#t~short48#1_11|, thread1Thread1of1ForFork0_#t~mem49#1=|v_thread1Thread1of1ForFork0_#t~mem49#1_11|, thread1Thread1of1ForFork0_#t~mem60#1=|v_thread1Thread1of1ForFork0_#t~mem60#1_11|, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_273, thread1Thread1of1ForFork0_#t~short58#1=|v_thread1Thread1of1ForFork0_#t~short58#1_11|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, ~break_12~0=v_~break_12~0_101, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_345, thread1Thread1of1ForFork0_#t~short53#1=|v_thread1Thread1of1ForFork0_#t~short53#1_11|, #memory_int=|v_#memory_int_1805|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_273, ~index_of_0~0.base=v_~index_of_0~0.base_539, ~index_of_4~0.offset=v_~index_of_4~0.offset_545, ~i2_11~0=v_~i2_11~0_195} AuxVars[|v_thread1_#t~short57#1_85|, |v_thread1_#t~short57#1_86|, |v_thread1_#t~short52#1_107|, |v_thread1_#t~short52#1_108|, |v_thread1_#t~mem51#1_76|, |v_thread1_#t~mem55#1_52|, |v_thread1_#t~mem56#1_56|, |v_thread1_#t~short53#1_98|, |v_thread1_#t~short53#1_97|, |v_thread1_#t~mem50#1_70|, |v_thread1_#t~short48#1_84|, |v_thread1_#t~short48#1_83|, |v_thread1_#t~short58#1_88|, |v_thread1_#t~short58#1_87|] AssignedVars[thread1Thread1of1ForFork0_#t~mem46#1, thread1Thread1of1ForFork0_#t~short57#1, thread1Thread1of1ForFork0_#t~mem59#1, thread1Thread1of1ForFork0_#t~nondet45#1, thread1Thread1of1ForFork0_#t~mem54#1, thread1Thread1of1ForFork0_#t~short52#1, thread1Thread1of1ForFork0_#t~short48#1, thread1Thread1of1ForFork0_#t~mem47#1, thread1Thread1of1ForFork0_#t~mem49#1, thread1Thread1of1ForFork0_#t~mem60#1, thread1Thread1of1ForFork0_#t~short58#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~break_12~0, thread1Thread1of1ForFork0_#t~mem51#1, thread1Thread1of1ForFork0_#t~mem56#1, thread1Thread1of1ForFork0_#t~short53#1, thread1Thread1of1ForFork0_#t~nondet35#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem55#1, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#t~mem50#1, ~i2_11~0] [2022-12-06 07:26:06,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [5048] $Ultimate##0-->L172: Formula: (let ((.cse0 (select (select |v_#memory_int_1827| v_~count_occurrences_of_6~0.base_353) (+ 12 v_~count_occurrences_of_6~0.offset_353))) (.cse1 (select |v_#memory_int_1827| v_~index_of_4~0.base_553)) (.cse2 (select |v_#memory_int_1827| v_~index_of_0~0.base_547)) (.cse3 (select (select |v_#memory_int_1827| v_~count_occurrences_of_2~0.base_361) (+ v_~count_occurrences_of_2~0.offset_361 12)))) (and (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet200#1_66| 256) 0)) (= (mod |v_thread2Thread1of1ForFork1_#t~nondet156#1_82| 256) 0) (or (and (= |v_thread2_#t~short207#1_97| |v_thread2Thread1of1ForFork1_#t~short207#1_10|) (= |v_thread2_#t~mem206#1_66| |v_thread2Thread1of1ForFork1_#t~mem206#1_10|) (= |v_thread2_#t~short208#1_75| |v_thread2_#t~short208#1_76|) (= |v_thread2_#t~mem205#1_60| |v_thread2Thread1of1ForFork1_#t~mem205#1_10|)) (and (= |v_thread2_#t~mem205#1_60| 1) (= |v_thread2_#t~mem205#1_60| .cse0) |v_thread2_#t~short207#1_98| |v_thread2_#t~short207#1_97| (= |v_thread2_#t~mem206#1_66| (select .cse1 (+ 8 v_~index_of_4~0.offset_553))) (not (= (+ |v_thread2_#t~mem206#1_66| 1) 0)))) (not (= (ite (not |v_thread2_#t~short203#1_65|) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= (+ (select .cse2 (+ v_~index_of_0~0.offset_547 16)) 1) 0) (= 0 v_~break_17~0_111) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (or (not |v_thread2_#t~short208#1_76|) (< 1 .cse0)) (= (mod |v_thread2Thread1of1ForFork1_#t~nondet190#1_92| 256) 0) (not (= (ite |v_thread2_#t~short213#1_94| 1 0) 0)) (not |v_thread2_#t~short203#1_66|) (not (= (ite |v_thread2_#t~short208#1_75| 1 0) 0)) (= (+ (select .cse1 (+ 16 v_~index_of_4~0.offset_553)) 1) 0) (or (and (= |v_thread2_#t~short212#1_97| |v_thread2Thread1of1ForFork1_#t~short212#1_10|) |v_thread2_#t~short213#1_93| (= |v_thread2_#t~mem210#1_60| |v_thread2Thread1of1ForFork1_#t~mem210#1_10|) (= |v_thread2_#t~mem211#1_66| |v_thread2Thread1of1ForFork1_#t~mem211#1_10|)) (and |v_thread2_#t~short212#1_97| |v_thread2_#t~short212#1_98| (= |v_thread2_#t~mem210#1_60| 1) (not (= (+ |v_thread2_#t~mem211#1_66| 1) 0)) (= .cse3 |v_thread2_#t~mem210#1_60|) (= |v_thread2_#t~mem211#1_66| (select .cse2 (+ v_~index_of_0~0.offset_547 8))))) (= v_~i2_16~0_187 0) (or (not |v_thread2_#t~short213#1_93|) (< 1 .cse3)) (= (ite (= (select (select |v_#memory_int_1827| v_~last_index_of_7~0.base_277) (+ v_~last_index_of_7~0.offset_277 12)) (select (select |v_#memory_int_1827| v_~last_index_of_3~0.base_271) (+ 12 v_~last_index_of_3~0.offset_271))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|))) InVars {~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_361, ~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_353, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_271, ~index_of_4~0.base=v_~index_of_4~0.base_553, thread2Thread1of1ForFork1_#t~mem205#1=|v_thread2Thread1of1ForFork1_#t~mem205#1_10|, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_271, thread2Thread1of1ForFork1_#t~mem211#1=|v_thread2Thread1of1ForFork1_#t~mem211#1_10|, thread2Thread1of1ForFork1_#t~nondet156#1=|v_thread2Thread1of1ForFork1_#t~nondet156#1_82|, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_361, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_277, thread2Thread1of1ForFork1_#t~mem206#1=|v_thread2Thread1of1ForFork1_#t~mem206#1_10|, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_353, thread2Thread1of1ForFork1_#t~short207#1=|v_thread2Thread1of1ForFork1_#t~short207#1_10|, #memory_int=|v_#memory_int_1827|, thread2Thread1of1ForFork1_#t~nondet200#1=|v_thread2Thread1of1ForFork1_#t~nondet200#1_66|, thread2Thread1of1ForFork1_#t~nondet190#1=|v_thread2Thread1of1ForFork1_#t~nondet190#1_92|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_277, ~index_of_0~0.offset=v_~index_of_0~0.offset_547, ~index_of_0~0.base=v_~index_of_0~0.base_547, ~index_of_4~0.offset=v_~index_of_4~0.offset_553, thread2Thread1of1ForFork1_#t~short212#1=|v_thread2Thread1of1ForFork1_#t~short212#1_10|, thread2Thread1of1ForFork1_#t~mem210#1=|v_thread2Thread1of1ForFork1_#t~mem210#1_10|} OutVars{thread2Thread1of1ForFork1_#t~short203#1=|v_thread2Thread1of1ForFork1_#t~short203#1_7|, ~last_index_of_3~0.offset=v_~last_index_of_3~0.offset_271, thread2Thread1of1ForFork1_#t~short208#1=|v_thread2Thread1of1ForFork1_#t~short208#1_7|, ~index_of_4~0.base=v_~index_of_4~0.base_553, thread2Thread1of1ForFork1_#t~mem215#1=|v_thread2Thread1of1ForFork1_#t~mem215#1_7|, ~last_index_of_3~0.base=v_~last_index_of_3~0.base_271, thread2Thread1of1ForFork1_#t~mem202#1=|v_thread2Thread1of1ForFork1_#t~mem202#1_9|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~break_17~0=v_~break_17~0_111, ~count_occurrences_of_2~0.offset=v_~count_occurrences_of_2~0.offset_361, thread2Thread1of1ForFork1_#t~mem204#1=|v_thread2Thread1of1ForFork1_#t~mem204#1_7|, ~i2_16~0=v_~i2_16~0_187, ~index_of_0~0.offset=v_~index_of_0~0.offset_547, ~count_occurrences_of_2~0.base=v_~count_occurrences_of_2~0.base_361, ~count_occurrences_of_6~0.offset=v_~count_occurrences_of_6~0.offset_353, thread2Thread1of1ForFork1_#t~mem209#1=|v_thread2Thread1of1ForFork1_#t~mem209#1_7|, thread2Thread1of1ForFork1_#t~short213#1=|v_thread2Thread1of1ForFork1_#t~short213#1_7|, ~last_index_of_7~0.offset=v_~last_index_of_7~0.offset_277, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork1_#t~mem201#1=|v_thread2Thread1of1ForFork1_#t~mem201#1_7|, thread2Thread1of1ForFork1_#t~mem214#1=|v_thread2Thread1of1ForFork1_#t~mem214#1_7|, ~count_occurrences_of_6~0.base=v_~count_occurrences_of_6~0.base_353, #memory_int=|v_#memory_int_1827|, ~last_index_of_7~0.base=v_~last_index_of_7~0.base_277, ~index_of_0~0.base=v_~index_of_0~0.base_547, ~index_of_4~0.offset=v_~index_of_4~0.offset_553} AuxVars[|v_thread2_#t~mem210#1_60|, |v_thread2_#t~short207#1_97|, |v_thread2_#t~short207#1_98|, |v_thread2_#t~short212#1_98|, |v_thread2_#t~short212#1_97|, |v_thread2_#t~mem206#1_66|, |v_thread2_#t~mem211#1_66|, |v_thread2_#t~short213#1_93|, |v_thread2_#t~short213#1_94|, |v_thread2_#t~mem205#1_60|, |v_thread2_#t~short208#1_75|, |v_thread2_#t~short208#1_76|, |v_thread2_#t~short203#1_65|, |v_thread2_#t~short203#1_66|] AssignedVars[thread2Thread1of1ForFork1_#t~short203#1, thread2Thread1of1ForFork1_#t~short208#1, thread2Thread1of1ForFork1_#t~mem215#1, thread2Thread1of1ForFork1_#t~mem205#1, thread2Thread1of1ForFork1_#t~mem202#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem211#1, thread2Thread1of1ForFork1_#t~mem209#1, thread2Thread1of1ForFork1_#t~short213#1, ~break_17~0, thread2Thread1of1ForFork1_#t~nondet156#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem201#1, thread2Thread1of1ForFork1_#t~mem214#1, thread2Thread1of1ForFork1_#t~mem206#1, thread2Thread1of1ForFork1_#t~short207#1, thread2Thread1of1ForFork1_#t~mem204#1, ~i2_16~0, thread2Thread1of1ForFork1_#t~nondet200#1, thread2Thread1of1ForFork1_#t~nondet190#1, thread2Thread1of1ForFork1_#t~short212#1, thread2Thread1of1ForFork1_#t~mem210#1] and [4976] L61-->L61: Formula: (let ((.cse37 (* v_~i1_9~0_182 4))) (let ((.cse12 (select (select |v_#memory_int_1761| v_~char_at_1~0.base_279) (+ v_~char_at_1~0.offset_279 .cse37)))) (let ((.cse16 (= .cse12 0))) (let ((.cse17 (not |v_thread1_#t~short30#1_77|)) (.cse5 (not |v_thread1_#t~short15#1_87|)) (.cse6 (select (select |v_#memory_int_1761| v_~char_at_5~0.base_285) (+ v_~char_at_5~0.offset_285 .cse37))) (.cse35 (mod v_~break_10~0_98 256)) (.cse15 (not |v_thread1_#t~short26#1_77|)) (.cse23 (not |v_thread1_#t~short26#1_78|)) (.cse2 (not |v_thread1_#t~short15#1_86|)) (.cse14 (not .cse16))) (and (let ((.cse0 (= |v_thread1Thread1of1ForFork0_#t~mem11#1_10| |v_thread1_#t~mem11#1_54|)) (.cse1 (= |v_thread1_#t~short13#1_91| |v_thread1Thread1of1ForFork0_#t~short13#1_10|)) (.cse3 (= |v_thread1Thread1of1ForFork0_#t~mem12#1_10| |v_thread1_#t~mem12#1_62|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_thread1_#t~short14#1_77| |v_thread1Thread1of1ForFork0_#t~short14#1_10|) (= |v_thread1Thread1of1ForFork0_#t~mem10#1_10| |v_thread1_#t~mem10#1_46|) (= |v_thread1_#t~short15#1_86| |v_thread1_#t~short15#1_87|)) (let ((.cse4 (not |v_thread1_#t~short14#1_77|)) (.cse11 (not |v_thread1_#t~short14#1_78|))) (and (or (and .cse4 .cse5) (and |v_thread1_#t~short14#1_77| |v_thread1_#t~short15#1_87|)) |v_thread1_#t~short15#1_86| (or (let ((.cse8 (not |v_thread1_#t~short13#1_92|)) (.cse9 (not |v_thread1_#t~short13#1_91|))) (and (= .cse6 |v_thread1_#t~mem11#1_54|) (let ((.cse7 (= |v_thread1_#t~mem11#1_54| 0))) (or (and |v_thread1_#t~short13#1_92| (not .cse7)) (and .cse7 .cse8))) (or (and .cse4 .cse9) (and |v_thread1_#t~short13#1_91| |v_thread1_#t~short14#1_77|)) |v_thread1_#t~short14#1_78| (or (and (= |v_thread1_#t~short13#1_92| |v_thread1_#t~short13#1_91|) .cse8 .cse3) (and (= .cse6 |v_thread1_#t~mem12#1_62|) |v_thread1_#t~short13#1_92| (let ((.cse10 (= 4 |v_thread1_#t~mem12#1_62|))) (or (and .cse9 .cse10) (and (not .cse10) |v_thread1_#t~short13#1_91|))))))) (and (= |v_thread1_#t~short14#1_77| |v_thread1_#t~short14#1_78|) .cse0 .cse11 .cse1 .cse3)) (= .cse12 |v_thread1_#t~mem10#1_46|) (let ((.cse13 (= |v_thread1_#t~mem10#1_46| 4))) (or (and (not .cse13) |v_thread1_#t~short14#1_78|) (and .cse11 .cse13))))))) (or (and |v_thread1_#t~short26#1_77| .cse14) (and .cse15 .cse16)) (let ((.cse20 (= |v_thread1Thread1of1ForFork0_#t~mem28#1_10| |v_thread1_#t~mem28#1_66|))) (or (let ((.cse19 (not |v_thread1_#t~short29#1_97|)) (.cse22 (not |v_thread1_#t~short29#1_98|))) (and .cse17 (let ((.cse18 (= |v_thread1_#t~mem27#1_64| 0))) (or (and (not .cse18) |v_thread1_#t~short29#1_97|) (and .cse19 .cse18))) (= |v_thread1_#t~mem27#1_64| .cse6) (or (and .cse19 .cse20 (= |v_thread1_#t~short29#1_97| |v_thread1_#t~short29#1_98|)) (and (let ((.cse21 (= |v_thread1_#t~mem28#1_66| 4))) (or (and (not .cse21) |v_thread1_#t~short29#1_98|) (and .cse22 .cse21))) (= |v_thread1_#t~mem28#1_66| .cse6) |v_thread1_#t~short29#1_97|)) (or (and |v_thread1_#t~short29#1_98| |v_thread1_#t~short30#1_78|) (and .cse22 (not |v_thread1_#t~short30#1_78|))))) (and (= |v_thread1_#t~short30#1_77| |v_thread1_#t~short30#1_78|) (= |v_thread1Thread1of1ForFork0_#t~short29#1_10| |v_thread1_#t~short29#1_98|) .cse20 (= |v_thread1Thread1of1ForFork0_#t~mem27#1_10| |v_thread1_#t~mem27#1_64|) |v_thread1_#t~short30#1_77|))) (or (and |v_thread1_#t~short26#1_78| |v_thread1_#t~short30#1_77|) (and .cse17 .cse23)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (let ((.cse29 (= |v_thread1Thread1of1ForFork0_#t~mem19#1_10| |v_thread1_#t~mem19#1_60|)) (.cse26 (= |v_thread1Thread1of1ForFork0_#t~mem17#1_10| |v_thread1_#t~mem17#1_58|)) (.cse30 (= |v_thread1Thread1of1ForFork0_#t~short21#1_10| |v_thread1_#t~short21#1_96|)) (.cse31 (= |v_thread1Thread1of1ForFork0_#t~mem20#1_10| |v_thread1_#t~mem20#1_62|))) (or (let ((.cse24 (not |v_thread1_#t~short18#1_92|)) (.cse28 (not |v_thread1_#t~short18#1_93|))) (and (= .cse12 |v_thread1_#t~mem16#1_52|) (let ((.cse25 (= |v_thread1_#t~mem16#1_52| 0))) (or (and .cse24 .cse25) (and (not .cse25) |v_thread1_#t~short18#1_92|))) (or (and (= |v_thread1_#t~short18#1_92| |v_thread1_#t~short18#1_93|) .cse26 .cse24) (and (= .cse12 |v_thread1_#t~mem17#1_58|) |v_thread1_#t~short18#1_92| (let ((.cse27 (= 4 |v_thread1_#t~mem17#1_58|))) (or (and |v_thread1_#t~short18#1_93| (not .cse27)) (and .cse27 .cse28))))) .cse5 (or (and .cse29 (= (+ |v_thread1_#t~ite22#1_57| 1) 0) .cse30 |v_thread1_#t~short18#1_93| .cse31) (let ((.cse32 (not |v_thread1_#t~short21#1_95|))) (and (let ((.cse33 (= |v_thread1_#t~mem19#1_60| 0))) (or (and .cse32 .cse33) (and |v_thread1_#t~short21#1_95| (not .cse33)))) (= (ite |v_thread1_#t~short21#1_96| 1 v_~result_8~0_295) |v_thread1_#t~ite22#1_57|) .cse28 (= .cse6 |v_thread1_#t~mem19#1_60|) (or (and (= |v_thread1_#t~short21#1_95| |v_thread1_#t~short21#1_96|) .cse32 .cse31) (and (let ((.cse34 (= |v_thread1_#t~mem20#1_62| 4))) (or (and (not |v_thread1_#t~short21#1_96|) .cse34) (and (not .cse34) |v_thread1_#t~short21#1_96|))) |v_thread1_#t~short21#1_95| (= |v_thread1_#t~mem20#1_62| .cse6)))))) (= v_~result_8~0_294 |v_thread1_#t~ite22#1_57|))) (and .cse29 (= v_~result_8~0_294 0) .cse26 .cse30 (= |v_thread1Thread1of1ForFork0_#t~ite22#1_10| |v_thread1_#t~ite22#1_57|) |v_thread1_#t~short15#1_87| (= |v_thread1Thread1of1ForFork0_#t~mem16#1_10| |v_thread1_#t~mem16#1_52|) .cse31 (= |v_thread1_#t~short18#1_93| |v_thread1Thread1of1ForFork0_#t~short18#1_10|)))) (= (+ v_~i1_9~0_182 1) v_~i1_9~0_181) (= (ite (and (<= v_~i1_9~0_182 12) (= .cse35 0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet8#1_20| 256) 0)) (= v_~break_10~0_97 (ite (= (ite |v_thread1_#t~short30#1_78| 1 .cse35) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_93| 0)) (or (and .cse15 (= |v_thread1Thread1of1ForFork0_#t~mem25#1_10| |v_thread1_#t~mem25#1_48|) (= |v_thread1_#t~short26#1_78| |v_thread1_#t~short26#1_77|)) (and (= |v_thread1_#t~mem25#1_48| .cse12) (let ((.cse36 (= |v_thread1_#t~mem25#1_48| 4))) (or (and (not .cse36) |v_thread1_#t~short26#1_78|) (and .cse36 .cse23))) |v_thread1_#t~short26#1_77|)) (or (and .cse2 .cse16) (and |v_thread1_#t~short15#1_86| .cse14))))))) InVars {thread1Thread1of1ForFork0_#t~mem11#1=|v_thread1Thread1of1ForFork0_#t~mem11#1_10|, thread1Thread1of1ForFork0_#t~short29#1=|v_thread1Thread1of1ForFork0_#t~short29#1_10|, thread1Thread1of1ForFork0_#t~mem16#1=|v_thread1Thread1of1ForFork0_#t~mem16#1_10|, thread1Thread1of1ForFork0_#t~ite22#1=|v_thread1Thread1of1ForFork0_#t~ite22#1_10|, thread1Thread1of1ForFork0_#t~mem12#1=|v_thread1Thread1of1ForFork0_#t~mem12#1_10|, thread1Thread1of1ForFork0_#t~mem25#1=|v_thread1Thread1of1ForFork0_#t~mem25#1_10|, ~char_at_1~0.offset=v_~char_at_1~0.offset_279, thread1Thread1of1ForFork0_#t~nondet8#1=|v_thread1Thread1of1ForFork0_#t~nondet8#1_20|, thread1Thread1of1ForFork0_#t~short21#1=|v_thread1Thread1of1ForFork0_#t~short21#1_10|, thread1Thread1of1ForFork0_#t~mem10#1=|v_thread1Thread1of1ForFork0_#t~mem10#1_10|, thread1Thread1of1ForFork0_#t~mem17#1=|v_thread1Thread1of1ForFork0_#t~mem17#1_10|, thread1Thread1of1ForFork0_#t~short13#1=|v_thread1Thread1of1ForFork0_#t~short13#1_10|, ~i1_9~0=v_~i1_9~0_182, thread1Thread1of1ForFork0_#t~mem27#1=|v_thread1Thread1of1ForFork0_#t~mem27#1_10|, thread1Thread1of1ForFork0_#t~short14#1=|v_thread1Thread1of1ForFork0_#t~short14#1_10|, ~char_at_5~0.offset=v_~char_at_5~0.offset_285, ~char_at_1~0.base=v_~char_at_1~0.base_279, thread1Thread1of1ForFork0_#t~short18#1=|v_thread1Thread1of1ForFork0_#t~short18#1_10|, ~result_8~0=v_~result_8~0_295, thread1Thread1of1ForFork0_#t~mem19#1=|v_thread1Thread1of1ForFork0_#t~mem19#1_10|, ~break_10~0=v_~break_10~0_98, thread1Thread1of1ForFork0_#t~mem28#1=|v_thread1Thread1of1ForFork0_#t~mem28#1_10|, #memory_int=|v_#memory_int_1761|, ~char_at_5~0.base=v_~char_at_5~0.base_285, thread1Thread1of1ForFork0_#t~mem20#1=|v_thread1Thread1of1ForFork0_#t~mem20#1_10|} OutVars{~char_at_1~0.offset=v_~char_at_1~0.offset_279, thread1Thread1of1ForFork0_#t~short26#1=|v_thread1Thread1of1ForFork0_#t~short26#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_93|, ~i1_9~0=v_~i1_9~0_181, thread1Thread1of1ForFork0_#t~short30#1=|v_thread1Thread1of1ForFork0_#t~short30#1_7|, thread1Thread1of1ForFork0_#t~ite23#1=|v_thread1Thread1of1ForFork0_#t~ite23#1_7|, thread1Thread1of1ForFork0_#t~mem9#1=|v_thread1Thread1of1ForFork0_#t~mem9#1_7|, ~char_at_5~0.offset=v_~char_at_5~0.offset_285, ~char_at_1~0.base=v_~char_at_1~0.base_279, ~result_8~0=v_~result_8~0_294, thread1Thread1of1ForFork0_#t~short15#1=|v_thread1Thread1of1ForFork0_#t~short15#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_93|, ~break_10~0=v_~break_10~0_97, #memory_int=|v_#memory_int_1761|, thread1Thread1of1ForFork0_#t~mem24#1=|v_thread1Thread1of1ForFork0_#t~mem24#1_7|, ~char_at_5~0.base=v_~char_at_5~0.base_285} AuxVars[|v_thread1_#t~mem19#1_60|, |v_thread1_#t~mem28#1_66|, |v_thread1_#t~mem25#1_48|, |v_thread1_#t~short15#1_86|, |v_thread1_#t~short30#1_77|, |v_thread1_#t~short30#1_78|, |v_thread1_#t~ite22#1_57|, |v_thread1_#t~short15#1_87|, |v_thread1_#t~short13#1_91|, |v_thread1_#t~short13#1_92|, |v_thread1_#t~mem16#1_52|, |v_thread1_#t~short21#1_95|, |v_thread1_#t~short21#1_96|, |v_thread1_#t~short14#1_77|, |v_thread1_#t~short14#1_78|, |v_thread1_#t~mem11#1_54|, |v_thread1_#t~mem17#1_58|, |v_thread1_#t~mem20#1_62|, |v_thread1_#t~mem12#1_62|, |v_thread1_#t~short26#1_77|, |v_thread1_#t~short26#1_78|, |v_thread1_#t~short29#1_98|, |v_thread1_#t~short29#1_97|, |v_thread1_#t~short18#1_92|, |v_thread1_#t~short18#1_93|, |v_thread1_#t~mem27#1_64|, |v_thread1_#t~mem10#1_46|] AssignedVars[thread1Thread1of1ForFork0_#t~mem11#1, thread1Thread1of1ForFork0_#t~short29#1, thread1Thread1of1ForFork0_#t~mem16#1, thread1Thread1of1ForFork0_#t~ite22#1, thread1Thread1of1ForFork0_#t~mem12#1, thread1Thread1of1ForFork0_#t~mem25#1, thread1Thread1of1ForFork0_#t~nondet8#1, thread1Thread1of1ForFork0_#t~short21#1, thread1Thread1of1ForFork0_#t~mem10#1, thread1Thread1of1ForFork0_#t~mem17#1, thread1Thread1of1ForFork0_#t~short13#1, thread1Thread1of1ForFork0_#t~short26#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~i1_9~0, thread1Thread1of1ForFork0_#t~short30#1, thread1Thread1of1ForFork0_#t~ite23#1, thread1Thread1of1ForFork0_#t~mem27#1, thread1Thread1of1ForFork0_#t~mem9#1, thread1Thread1of1ForFork0_#t~short14#1, thread1Thread1of1ForFork0_#t~short18#1, ~result_8~0, thread1Thread1of1ForFork0_#t~mem19#1, thread1Thread1of1ForFork0_#t~short15#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~break_10~0, thread1Thread1of1ForFork0_#t~mem28#1, thread1Thread1of1ForFork0_#t~mem24#1, thread1Thread1of1ForFork0_#t~mem20#1] [2022-12-06 07:26:08,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3559 [2022-12-06 07:26:08,835 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 106 transitions, 798 flow [2022-12-06 07:26:08,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:08,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,836 INFO L213 CegarLoopForPetriNet]: trace histogram [12, 12, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:26:09,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:09,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1526157727, now seen corresponding path program 1 times [2022-12-06 07:26:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681066434] [2022-12-06 07:26:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-06 07:26:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681066434] [2022-12-06 07:26:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681066434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905309774] [2022-12-06 07:26:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:09,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:09,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:09,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:26:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:10,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:26:10,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-06 07:26:10,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:26:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-06 07:26:10,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905309774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:26:10,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:26:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2022-12-06 07:26:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134193065] [2022-12-06 07:26:10,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 07:26:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 07:26:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2022-12-06 07:26:10,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:26:10,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 106 transitions, 798 flow. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:26:10,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,806 INFO L130 PetriNetUnfolder]: 210/413 cut-off events. [2022-12-06 07:26:10,806 INFO L131 PetriNetUnfolder]: For 720/720 co-relation queries the response was YES. [2022-12-06 07:26:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 413 events. 210/413 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1201 event pairs, 70 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1597. Up to 362 conditions per place. [2022-12-06 07:26:10,809 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 48 selfloop transitions, 60 changer transitions 0/108 dead transitions. [2022-12-06 07:26:10,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 108 transitions, 1030 flow [2022-12-06 07:26:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:26:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:26:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 94 transitions. [2022-12-06 07:26:10,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1175 [2022-12-06 07:26:10,812 INFO L175 Difference]: Start difference. First operand has 80 places, 106 transitions, 798 flow. Second operand 20 states and 94 transitions. [2022-12-06 07:26:10,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 108 transitions, 1030 flow [2022-12-06 07:26:10,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 108 transitions, 1020 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 07:26:10,817 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=934, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2022-12-06 07:26:10,818 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 07:26:10,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,819 INFO L89 Accepts]: Start accepts. Operand has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,905 INFO L130 PetriNetUnfolder]: 65/205 cut-off events. [2022-12-06 07:26:10,905 INFO L131 PetriNetUnfolder]: For 237/251 co-relation queries the response was YES. [2022-12-06 07:26:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 205 events. 65/205 cut-off events. For 237/251 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 527 event pairs, 1 based on Foata normal form. 2/180 useless extension candidates. Maximal degree in co-relation 650. Up to 89 conditions per place. [2022-12-06 07:26:10,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 07:26:10,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:10,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:26:10,909 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 934 flow [2022-12-06 07:26:10,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,909 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:26:11,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:11,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -713421214, now seen corresponding path program 2 times [2022-12-06 07:26:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727911096] [2022-12-06 07:26:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:26:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727911096] [2022-12-06 07:26:11,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727911096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130338495] [2022-12-06 07:26:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:11,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:26:11,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:26:11,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,694 INFO L130 PetriNetUnfolder]: 195/409 cut-off events. [2022-12-06 07:26:11,694 INFO L131 PetriNetUnfolder]: For 536/536 co-relation queries the response was YES. [2022-12-06 07:26:11,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 409 events. 195/409 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1299 event pairs, 58 based on Foata normal form. 6/377 useless extension candidates. Maximal degree in co-relation 1558. Up to 262 conditions per place. [2022-12-06 07:26:11,697 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 114 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2022-12-06 07:26:11,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 1204 flow [2022-12-06 07:26:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 07:26:11,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 07:26:11,697 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 934 flow. Second operand 3 states and 56 transitions. [2022-12-06 07:26:11,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 1204 flow [2022-12-06 07:26:11,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 1024 flow, removed 14 selfloop flow, removed 17 redundant places. [2022-12-06 07:26:11,702 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2022-12-06 07:26:11,703 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2022-12-06 07:26:11,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,703 INFO L89 Accepts]: Start accepts. Operand has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,786 INFO L130 PetriNetUnfolder]: 55/204 cut-off events. [2022-12-06 07:26:11,786 INFO L131 PetriNetUnfolder]: For 282/294 co-relation queries the response was YES. [2022-12-06 07:26:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 204 events. 55/204 cut-off events. For 282/294 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 582 event pairs, 7 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 576. Up to 81 conditions per place. [2022-12-06 07:26:11,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 07:26:11,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:11,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:11,790 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 747 flow [2022-12-06 07:26:11,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,790 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:26:11,790 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1506558513, now seen corresponding path program 1 times [2022-12-06 07:26:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812421566] [2022-12-06 07:26:11,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:26:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812421566] [2022-12-06 07:26:12,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812421566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:26:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583347383] [2022-12-06 07:26:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:26:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:26:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:26:12,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:26:12,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:26:12,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,302 INFO L130 PetriNetUnfolder]: 176/374 cut-off events. [2022-12-06 07:26:12,302 INFO L131 PetriNetUnfolder]: For 656/656 co-relation queries the response was YES. [2022-12-06 07:26:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 374 events. 176/374 cut-off events. For 656/656 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1119 event pairs, 67 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 1439. Up to 296 conditions per place. [2022-12-06 07:26:12,305 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 112 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2022-12-06 07:26:12,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1015 flow [2022-12-06 07:26:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:26:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:26:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 07:26:12,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 07:26:12,305 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 747 flow. Second operand 3 states and 53 transitions. [2022-12-06 07:26:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1015 flow [2022-12-06 07:26:12,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 1001 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:12,311 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=86, PETRI_TRANSITIONS=104} [2022-12-06 07:26:12,311 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2022-12-06 07:26:12,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,311 INFO L89 Accepts]: Start accepts. Operand has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,395 INFO L130 PetriNetUnfolder]: 52/192 cut-off events. [2022-12-06 07:26:12,396 INFO L131 PetriNetUnfolder]: For 255/264 co-relation queries the response was YES. [2022-12-06 07:26:12,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 192 events. 52/192 cut-off events. For 255/264 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 493 event pairs, 7 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 554. Up to 75 conditions per place. [2022-12-06 07:26:12,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 07:26:12,397 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:12,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 07:26:12,398 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 738 flow [2022-12-06 07:26:12,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:12,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,398 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:26:12,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 453761400, now seen corresponding path program 1 times [2022-12-06 07:26:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296047130] [2022-12-06 07:26:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-12-06 07:26:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296047130] [2022-12-06 07:26:18,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296047130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:18,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477885862] [2022-12-06 07:26:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:18,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:18,885 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:18,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:26:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:26:19,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:19,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:19,591 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-12-06 07:26:19,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2022-12-06 07:26:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:19,652 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-06 07:26:19,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 07:26:20,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:20,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:20,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:20,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:20,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:20,966 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 07:26:20,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 117 [2022-12-06 07:26:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-12-06 07:26:21,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:26:21,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477885862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:26:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 33 [2022-12-06 07:26:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382417649] [2022-12-06 07:26:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:26:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:26:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2022-12-06 07:26:21,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:26:21,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 738 flow. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:26:21,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,285 INFO L130 PetriNetUnfolder]: 168/358 cut-off events. [2022-12-06 07:26:22,286 INFO L131 PetriNetUnfolder]: For 587/587 co-relation queries the response was YES. [2022-12-06 07:26:22,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 358 events. 168/358 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1043 event pairs, 47 based on Foata normal form. 6/330 useless extension candidates. Maximal degree in co-relation 1374. Up to 168 conditions per place. [2022-12-06 07:26:22,288 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 102 selfloop transitions, 12 changer transitions 0/114 dead transitions. [2022-12-06 07:26:22,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 114 transitions, 1005 flow [2022-12-06 07:26:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:26:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:26:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-12-06 07:26:22,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1275 [2022-12-06 07:26:22,289 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 738 flow. Second operand 10 states and 51 transitions. [2022-12-06 07:26:22,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 114 transitions, 1005 flow [2022-12-06 07:26:22,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 114 transitions, 999 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:26:22,294 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=777, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2022-12-06 07:26:22,295 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2022-12-06 07:26:22,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,295 INFO L89 Accepts]: Start accepts. Operand has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,371 INFO L130 PetriNetUnfolder]: 50/184 cut-off events. [2022-12-06 07:26:22,371 INFO L131 PetriNetUnfolder]: For 326/334 co-relation queries the response was YES. [2022-12-06 07:26:22,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 184 events. 50/184 cut-off events. For 326/334 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 444 event pairs, 6 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 554. Up to 71 conditions per place. [2022-12-06 07:26:22,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 07:26:22,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:26:22,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:26:22,374 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 777 flow [2022-12-06 07:26:22,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:22,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,374 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:26:22,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:26:22,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1675246654, now seen corresponding path program 1 times [2022-12-06 07:26:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871382960] [2022-12-06 07:26:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:26:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871382960] [2022-12-06 07:26:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871382960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969122764] [2022-12-06 07:26:23,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:23,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:23,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:26:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:26:24,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:24,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:24,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:26:24,254 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:26:24,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-12-06 07:26:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:26:24,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:29:22,648 WARN L233 SmtUtils]: Spent 2.96m on a formula simplification. DAG size of input: 105 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:29:22,805 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~index_of_0~0.offset 16)) (.cse3 (+ c_~index_of_4~0.offset 16))) (and (forall ((v_ArrVal_2308 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308))) (let ((.cse1 (select (select .cse2 c_~index_of_0~0.base) .cse4)) (.cse0 (select (select .cse2 c_~index_of_4~0.base) .cse3))) (or (not (<= .cse0 (+ 2147483647 .cse1))) (= .cse1 .cse0) (not (<= .cse1 (+ 2147483648 .cse0))))))) (forall ((v_ArrVal_2308 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308))) (let ((.cse5 (select .cse6 c_~index_of_4~0.base))) (or (not (= (+ (select .cse5 (+ c_~index_of_4~0.offset 8)) 1) 0)) (not (= (+ (select (select .cse6 c_~index_of_0~0.base) .cse4) 1) 0)) (not (= (+ (select .cse5 .cse3) 1) 0)) (forall ((~count_occurrences_of_6~0.base Int) (~count_occurrences_of_6~0.offset Int)) (< 1 (select (select .cse6 ~count_occurrences_of_6~0.base) (+ ~count_occurrences_of_6~0.offset 12)))))))) (forall ((v_ArrVal_2308 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308))) (or (forall ((~count_occurrences_of_2~0.base Int) (~count_occurrences_of_2~0.offset Int)) (let ((.cse7 (select (select .cse8 ~count_occurrences_of_2~0.base) (+ 12 ~count_occurrences_of_2~0.offset)))) (or (< 1 .cse7) (= 1 .cse7)))) (not (= (+ (select (select .cse8 c_~index_of_0~0.base) .cse4) 1) 0)) (not (= (+ (select (select .cse8 c_~index_of_4~0.base) .cse3) 1) 0))))) (forall ((v_ArrVal_2308 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308))) (or (forall ((~last_index_of_7~0.offset Int) (~last_index_of_7~0.base Int) (~last_index_of_3~0.base Int) (~last_index_of_3~0.offset Int)) (let ((.cse9 (select (select .cse11 ~last_index_of_7~0.base) (+ ~last_index_of_7~0.offset 12))) (.cse10 (select (select .cse11 ~last_index_of_3~0.base) (+ ~last_index_of_3~0.offset 12)))) (or (not (<= .cse9 (+ 2147483647 .cse10))) (not (<= .cse10 (+ .cse9 2147483648))) (= .cse9 .cse10)))) (not (= (+ (select (select .cse11 c_~index_of_0~0.base) .cse4) 1) 0)) (not (= (+ (select (select .cse11 c_~index_of_4~0.base) .cse3) 1) 0))))) (forall ((v_ArrVal_2308 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308))) (let ((.cse12 (select .cse13 c_~index_of_0~0.base))) (or (not (= (+ (select .cse12 (+ c_~index_of_0~0.offset 8)) 1) 0)) (not (= (+ (select .cse12 .cse4) 1) 0)) (forall ((~count_occurrences_of_2~0.base Int) (~count_occurrences_of_2~0.offset Int)) (< 1 (select (select .cse13 ~count_occurrences_of_2~0.base) (+ 12 ~count_occurrences_of_2~0.offset)))) (not (= (+ (select (select .cse13 c_~index_of_4~0.base) .cse3) 1) 0)))))))) is different from false [2022-12-06 07:29:23,428 INFO L321 Elim1Store]: treesize reduction 11, result has 97.4 percent of original size [2022-12-06 07:29:23,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 992 treesize of output 1153 [2022-12-06 07:29:23,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:29:23,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 702 treesize of output 703 [2022-12-06 07:29:23,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:29:23,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 646 treesize of output 679 [2022-12-06 07:29:23,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:29:23,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 630 treesize of output 591 [2022-12-06 07:29:23,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:29:23,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 582 treesize of output 595 [2022-12-06 07:29:23,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:29:23,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 566 treesize of output 599 [2022-12-06 07:30:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 1 not checked. [2022-12-06 07:30:55,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969122764] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:30:55,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:30:55,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 07:30:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626412626] [2022-12-06 07:30:55,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:30:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:30:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2022-12-06 07:30:55,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:30:55,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 777 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:55,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:30:55,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,138 INFO L130 PetriNetUnfolder]: 120/272 cut-off events. [2022-12-06 07:30:56,138 INFO L131 PetriNetUnfolder]: For 737/737 co-relation queries the response was YES. [2022-12-06 07:30:56,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 272 events. 120/272 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 640 event pairs, 40 based on Foata normal form. 18/266 useless extension candidates. Maximal degree in co-relation 1059. Up to 173 conditions per place. [2022-12-06 07:30:56,140 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 102 selfloop transitions, 2 changer transitions 3/107 dead transitions. [2022-12-06 07:30:56,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 955 flow [2022-12-06 07:30:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 07:30:56,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30625 [2022-12-06 07:30:56,141 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 777 flow. Second operand 4 states and 49 transitions. [2022-12-06 07:30:56,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 955 flow [2022-12-06 07:30:56,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 930 flow, removed 1 selfloop flow, removed 9 redundant places. [2022-12-06 07:30:56,145 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 679 flow [2022-12-06 07:30:56,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2022-12-06 07:30:56,145 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 07:30:56,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,146 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 679 flow [2022-12-06 07:30:56,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 679 flow [2022-12-06 07:30:56,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 98 transitions, 679 flow [2022-12-06 07:30:56,191 INFO L130 PetriNetUnfolder]: 34/135 cut-off events. [2022-12-06 07:30:56,192 INFO L131 PetriNetUnfolder]: For 170/172 co-relation queries the response was YES. [2022-12-06 07:30:56,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 135 events. 34/135 cut-off events. For 170/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 181 event pairs, 4 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 388. Up to 43 conditions per place. [2022-12-06 07:30:56,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 98 transitions, 679 flow [2022-12-06 07:30:56,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 07:30:56,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:30:56,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 07:30:56,194 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 679 flow [2022-12-06 07:30:56,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,194 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:30:56,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:30:56,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:30:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 830225107, now seen corresponding path program 1 times [2022-12-06 07:30:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685417042] [2022-12-06 07:30:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-12-06 07:30:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685417042] [2022-12-06 07:30:56,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685417042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:30:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244575762] [2022-12-06 07:30:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:30:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:30:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:30:56,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:30:56,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:30:56,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,810 INFO L130 PetriNetUnfolder]: 109/248 cut-off events. [2022-12-06 07:30:56,811 INFO L131 PetriNetUnfolder]: For 362/362 co-relation queries the response was YES. [2022-12-06 07:30:56,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 248 events. 109/248 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 501 event pairs, 35 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 918. Up to 200 conditions per place. [2022-12-06 07:30:56,812 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 102 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2022-12-06 07:30:56,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 912 flow [2022-12-06 07:30:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:30:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:30:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:30:56,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 07:30:56,814 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 679 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:30:56,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 912 flow [2022-12-06 07:30:56,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 105 transitions, 896 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 07:30:56,818 INFO L231 Difference]: Finished difference. Result has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=84, PETRI_TRANSITIONS=98} [2022-12-06 07:30:56,818 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 07:30:56,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,818 INFO L89 Accepts]: Start accepts. Operand has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,865 INFO L130 PetriNetUnfolder]: 35/138 cut-off events. [2022-12-06 07:30:56,865 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-06 07:30:56,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 138 events. 35/138 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 196 event pairs, 5 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 398. Up to 46 conditions per place. [2022-12-06 07:30:56,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 07:30:56,867 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:30:56,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 07:30:56,867 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 98 transitions, 675 flow [2022-12-06 07:30:56,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:56,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,867 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:30:56,868 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:30:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash 334671440, now seen corresponding path program 1 times [2022-12-06 07:30:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017876292] [2022-12-06 07:30:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-12-06 07:30:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017876292] [2022-12-06 07:30:57,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017876292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:30:57,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246029324] [2022-12-06 07:30:57,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:30:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:30:57,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:30:57,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:30:57,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:30:57,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,241 INFO L130 PetriNetUnfolder]: 115/260 cut-off events. [2022-12-06 07:30:57,241 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-06 07:30:57,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 260 events. 115/260 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 544 event pairs, 41 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 967. Up to 212 conditions per place. [2022-12-06 07:30:57,243 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 102 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2022-12-06 07:30:57,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 908 flow [2022-12-06 07:30:57,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:30:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:30:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 07:30:57,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 07:30:57,243 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 675 flow. Second operand 3 states and 47 transitions. [2022-12-06 07:30:57,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 908 flow [2022-12-06 07:30:57,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 905 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:30:57,247 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2022-12-06 07:30:57,248 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2022-12-06 07:30:57,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,248 INFO L89 Accepts]: Start accepts. Operand has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,297 INFO L130 PetriNetUnfolder]: 32/135 cut-off events. [2022-12-06 07:30:57,297 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 07:30:57,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 135 events. 32/135 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 186 event pairs, 5 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 400. Up to 43 conditions per place. [2022-12-06 07:30:57,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 07:30:57,299 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:30:57,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 07:30:57,299 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 684 flow [2022-12-06 07:30:57,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:30:57,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,300 INFO L213 CegarLoopForPetriNet]: trace histogram [13, 13, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:30:57,301 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:30:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,301 INFO L85 PathProgramCache]: Analyzing trace with hash 819061867, now seen corresponding path program 1 times [2022-12-06 07:30:57,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469657372] [2022-12-06 07:30:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:31:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469657372] [2022-12-06 07:31:04,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469657372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:31:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884885478] [2022-12-06 07:31:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:31:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:31:04,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:31:04,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:31:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:31:05,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:31:10,014 INFO L321 Elim1Store]: treesize reduction 12, result has 96.0 percent of original size [2022-12-06 07:31:10,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 128 treesize of output 366 [2022-12-06 07:31:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-12-06 07:31:10,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:15,838 WARN L233 SmtUtils]: Spent 42.08s on a formula simplification. DAG size of input: 2752 DAG size of output: 2747 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 07:32:15,844 INFO L321 Elim1Store]: treesize reduction 11, result has 99.8 percent of original size [2022-12-06 07:32:15,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 37 select indices, 37 select index equivalence classes, 0 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 666 case distinctions, treesize of input 710 treesize of output 7010 Received shutdown request... [2022-12-06 07:37:39,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:37:39,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:37:39,219 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 07:37:39,221 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 07:37:39,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 07:37:39,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:37:39,430 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 75 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 32ms.. [2022-12-06 07:37:39,431 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 07:37:39,431 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 07:37:39,431 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,433 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:37:39,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:37:39,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:37:39 BasicIcfg [2022-12-06 07:37:39,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:37:39,435 INFO L158 Benchmark]: Toolchain (without parser) took 837730.08ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 141.6MB in the beginning and 500.7MB in the end (delta: -359.1MB). Peak memory consumption was 957.6MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 165.7MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.41ms. Allocated memory is still 165.7MB. Free memory was 141.4MB in the beginning and 115.3MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.27ms. Allocated memory is still 165.7MB. Free memory was 115.3MB in the beginning and 107.5MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: Boogie Preprocessor took 103.25ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 100.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: RCFGBuilder took 2367.62ms. Allocated memory was 165.7MB in the beginning and 340.8MB in the end (delta: 175.1MB). Free memory was 100.2MB in the beginning and 267.7MB in the end (delta: -167.5MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,436 INFO L158 Benchmark]: TraceAbstraction took 834776.85ms. Allocated memory was 340.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 267.2MB in the beginning and 500.7MB in the end (delta: -233.5MB). Peak memory consumption was 909.7MB. Max. memory is 8.0GB. [2022-12-06 07:37:39,437 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 165.7MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 62.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.41ms. Allocated memory is still 165.7MB. Free memory was 141.4MB in the beginning and 115.3MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 133.27ms. Allocated memory is still 165.7MB. Free memory was 115.3MB in the beginning and 107.5MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.25ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 100.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2367.62ms. Allocated memory was 165.7MB in the beginning and 340.8MB in the end (delta: 175.1MB). Free memory was 100.2MB in the beginning and 267.7MB in the end (delta: -167.5MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. * TraceAbstraction took 834776.85ms. Allocated memory was 340.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 267.2MB in the beginning and 500.7MB in the end (delta: -233.5MB). Peak memory consumption was 909.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.0s, 375 PlacesBefore, 30 PlacesAfterwards, 421 TransitionsBefore, 39 TransitionsAfterwards, 5828 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 270 TrivialYvCompositions, 75 ConcurrentYvCompositions, 31 ChoiceCompositions, 376 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3964, independent: 3957, independent conditional: 3957, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3964, independent: 3957, independent conditional: 0, independent unconditional: 3957, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3964, independent: 3957, independent conditional: 0, independent unconditional: 3957, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3964, independent: 3957, independent conditional: 0, independent unconditional: 3957, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3082, independent: 3075, independent conditional: 0, independent unconditional: 3075, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3082, independent: 3075, independent conditional: 0, independent unconditional: 3075, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3964, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3082, unknown conditional: 0, unknown unconditional: 3082] , Statistics on independence cache: Total cache size (in pairs): 5877, Positive cache size: 5870, Positive conditional cache size: 0, Positive unconditional cache size: 5870, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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, 29 PlacesBefore, 29 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 182 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 31 PlacesBefore, 31 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 182 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 41 PlacesBefore, 41 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 182 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 56 PlacesBefore, 56 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 182 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 204 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.2s, 58 PlacesBefore, 59 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 77 PlacesBefore, 77 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 200 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): 5, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 76 PlacesBefore, 76 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 4, independent unconditional: 7, 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: 8, independent: 8, independent conditional: 1, independent unconditional: 7, 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: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 6, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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: 3.5s, 80 PlacesBefore, 80 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 99 PlacesBefore, 99 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 142 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 85 PlacesBefore, 85 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 130 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 86 PlacesBefore, 86 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 122 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 95 PlacesBefore, 95 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 128 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 86 PlacesBefore, 86 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 100 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 84 PlacesBefore, 84 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 104 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 86 PlacesBefore, 86 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 108 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): 19, Positive cache size: 19, Positive conditional cache size: 12, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 235]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 75 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 32ms.. - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 75 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 32ms.. - TimeoutResultAtElement [Line: 230]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 75 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 32ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 457 locations, 3 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: 834.6s, OverallIterations: 17, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 863 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2035 IncrementalHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 0 mSDtfsCounter, 2035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 752 SyntacticMatches, 14 SemanticMatches, 183 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 181.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=934occurred in iteration=10, InterpolantAutomatonStates: 109, 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.6s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 369.0s InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1678 ConstructedInterpolants, 6 QuantifiedInterpolants, 17755 SizeOfPredicates, 185 NumberOfNonLiveVariables, 5431 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 4022/4507 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown