/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:10:15,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:10:15,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:10:15,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:10:15,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:10:15,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:10:15,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:10:15,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:10:15,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:10:15,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:10:15,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:10:15,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:10:15,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:10:15,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:10:15,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:10:15,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:10:15,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:10:15,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:10:15,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:10:15,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:10:15,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:10:15,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:10:15,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:10:15,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:10:15,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:10:15,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:10:15,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:10:15,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:10:15,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:10:15,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:10:15,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:10:15,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:10:15,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:10:15,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:10:15,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:10:15,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:10:15,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:10:15,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:10:15,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:10:15,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:10:15,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:10:15,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:10:15,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:10:15,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:10:15,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:10:15,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:10:15,895 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:10:15,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:10:15,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:10:15,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:10:15,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:10:15,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:10:15,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:10:15,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:10:15,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:10:15,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:10:15,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:10:15,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:10:15,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:10:15,900 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 05:10:16,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:10:16,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:10:16,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:10:16,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:10:16,278 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:10:16,279 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 05:10:17,476 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:10:17,738 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:10:17,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-symm.wvr.c [2022-12-06 05:10:17,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9477e9591/752ed76dc2754926bb70bbc1d331d41f/FLAGbf54700c7 [2022-12-06 05:10:17,759 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9477e9591/752ed76dc2754926bb70bbc1d331d41f [2022-12-06 05:10:17,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:10:17,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:10:17,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:10:17,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:10:17,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:10:17,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:10:17" (1/1) ... [2022-12-06 05:10:17,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcc8ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:17, skipping insertion in model container [2022-12-06 05:10:17,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:10:17" (1/1) ... [2022-12-06 05:10:17,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:10:17,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:10:17,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:17,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:17,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,018 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 05:10:18,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:10:18,036 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:10:18,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:10:18,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:10:18,127 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 05:10:18,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:10:18,148 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:10:18,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18 WrapperNode [2022-12-06 05:10:18,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:10:18,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:10:18,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:10:18,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:10:18,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,272 INFO L138 Inliner]: procedures = 25, calls = 307, calls flagged for inlining = 69, calls inlined = 97, statements flattened = 1522 [2022-12-06 05:10:18,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:10:18,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:10:18,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:10:18,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:10:18,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:10:18,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:10:18,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:10:18,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:10:18,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (1/1) ... [2022-12-06 05:10:18,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:10:18,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:10:18,402 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 05:10:18,425 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 05:10:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:10:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:10:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:10:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:10:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:10:18,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:10:18,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:10:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:10:18,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:10:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:10:18,444 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 05:10:18,659 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:10:18,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:10:19,995 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:10:21,534 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:10:21,539 INFO L302 CfgBuilder]: Removed 12 assume(true) statements. [2022-12-06 05:10:21,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:10:21 BoogieIcfgContainer [2022-12-06 05:10:21,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:10:21,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:10:21,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:10:21,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:10:21,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:10:17" (1/3) ... [2022-12-06 05:10:21,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb3ed04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:10:21, skipping insertion in model container [2022-12-06 05:10:21,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:10:18" (2/3) ... [2022-12-06 05:10:21,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb3ed04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:10:21, skipping insertion in model container [2022-12-06 05:10:21,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:10:21" (3/3) ... [2022-12-06 05:10:21,552 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2022-12-06 05:10:21,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:10:21,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:10:21,570 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:10:21,843 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:10:21,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 431 transitions, 878 flow [2022-12-06 05:10:22,048 INFO L130 PetriNetUnfolder]: 53/429 cut-off events. [2022-12-06 05:10:22,049 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:10:22,057 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 05:10:22,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 385 places, 431 transitions, 878 flow [2022-12-06 05:10:22,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 421 transitions, 854 flow [2022-12-06 05:10:22,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:10:22,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 421 transitions, 854 flow [2022-12-06 05:10:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 421 transitions, 854 flow [2022-12-06 05:10:22,188 INFO L130 PetriNetUnfolder]: 53/421 cut-off events. [2022-12-06 05:10:22,188 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:10:22,190 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 05:10:22,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 421 transitions, 854 flow [2022-12-06 05:10:22,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 5828 [2022-12-06 05:11:09,598 INFO L203 LiptonReduction]: Total number of compositions: 376 [2022-12-06 05:11:09,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:11:09,614 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;@7374d1b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:11:09,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:11:09,640 INFO L130 PetriNetUnfolder]: 16/38 cut-off events. [2022-12-06 05:11:09,640 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:11:09,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:09,641 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 05:11:09,641 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 05:11:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1640273470, now seen corresponding path program 1 times [2022-12-06 05:11:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:09,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874505557] [2022-12-06 05:11:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:10,257 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 05:11:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:10,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874505557] [2022-12-06 05:11:10,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874505557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:11:10,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:11:10,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:11:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145030916] [2022-12-06 05:11:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:11:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:11:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:11:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:11:10,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:11:10,289 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 05:11:10,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:10,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:11:10,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:10,591 INFO L130 PetriNetUnfolder]: 133/194 cut-off events. [2022-12-06 05:11:10,592 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:11:10,592 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 05:11:10,594 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 37 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-06 05:11:10,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 176 flow [2022-12-06 05:11:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:11:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:11:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 05:11:10,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36752136752136755 [2022-12-06 05:11:10,605 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 90 flow. Second operand 3 states and 43 transitions. [2022-12-06 05:11:10,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 176 flow [2022-12-06 05:11:10,608 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 05:11:10,609 INFO L231 Difference]: Finished difference. Result has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,611 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 05:11:10,614 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-12-06 05:11:10,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:10,615 INFO L89 Accepts]: Start accepts. Operand has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:10,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:10,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,644 INFO L130 PetriNetUnfolder]: 16/41 cut-off events. [2022-12-06 05:11:10,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:11:10,645 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 05:11:10,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:11:10,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:10,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 05:11:10,647 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 41 transitions, 104 flow [2022-12-06 05:11:10,647 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 05:11:10,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:10,648 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 05:11:10,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:11:10,648 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 05:11:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1708896424, now seen corresponding path program 1 times [2022-12-06 05:11:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:10,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672002252] [2022-12-06 05:11:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:10,872 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 05:11:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:10,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672002252] [2022-12-06 05:11:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672002252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:11:10,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:11:10,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:11:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443208555] [2022-12-06 05:11:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:11:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:11:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:11:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:11:10,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:11:10,875 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 05:11:10,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:10,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:11:10,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:11,145 INFO L130 PetriNetUnfolder]: 133/198 cut-off events. [2022-12-06 05:11:11,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:11:11,146 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 05:11:11,149 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-06 05:11:11,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 202 flow [2022-12-06 05:11:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:11:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:11:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:11:11,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4017094017094017 [2022-12-06 05:11:11,152 INFO L175 Difference]: Start difference. First operand has 29 places, 41 transitions, 104 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:11:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 202 flow [2022-12-06 05:11:11,153 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 05:11:11,154 INFO L231 Difference]: Finished difference. Result has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,154 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 05:11:11,155 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 05:11:11,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:11,155 INFO L89 Accepts]: Start accepts. Operand has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:11,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:11,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,185 INFO L130 PetriNetUnfolder]: 16/45 cut-off events. [2022-12-06 05:11:11,185 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:11:11,187 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 05:11:11,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:11:11,189 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:11,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 05:11:11,191 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 45 transitions, 142 flow [2022-12-06 05:11:11,191 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 05:11:11,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:11,191 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 05:11:11,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:11:11,191 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 05:11:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -118114530, now seen corresponding path program 1 times [2022-12-06 05:11:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075922149] [2022-12-06 05:11:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:11,499 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 05:11:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:11,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075922149] [2022-12-06 05:11:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075922149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:11:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881472736] [2022-12-06 05:11:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:11,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:11:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:11:11,503 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 05:11:11,545 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 05:11:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:12,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:11:12,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:11:12,126 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 05:11:12,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:11:12,160 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 05:11:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881472736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:11:12,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:11:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 05:11:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820436946] [2022-12-06 05:11:12,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:11:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:11:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:11:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:11:12,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:11:12,163 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 05:11:12,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:12,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:11:12,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:12,472 INFO L130 PetriNetUnfolder]: 133/216 cut-off events. [2022-12-06 05:11:12,472 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:11:12,472 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 05:11:12,473 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 31 selfloop transitions, 32 changer transitions 0/63 dead transitions. [2022-12-06 05:11:12,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 63 transitions, 324 flow [2022-12-06 05:11:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:11:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:11:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-06 05:11:12,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25961538461538464 [2022-12-06 05:11:12,475 INFO L175 Difference]: Start difference. First operand has 31 places, 45 transitions, 142 flow. Second operand 8 states and 81 transitions. [2022-12-06 05:11:12,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 63 transitions, 324 flow [2022-12-06 05:11:12,476 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 05:11:12,478 INFO L231 Difference]: Finished difference. Result has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,478 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 05:11:12,479 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2022-12-06 05:11:12,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:12,480 INFO L89 Accepts]: Start accepts. Operand has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:12,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:12,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,511 INFO L130 PetriNetUnfolder]: 16/63 cut-off events. [2022-12-06 05:11:12,511 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:11:12,511 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 05:11:12,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:11:12,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:12,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 05:11:12,517 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 63 transitions, 318 flow [2022-12-06 05:11:12,517 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 05:11:12,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:12,517 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 05:11:12,528 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 05:11:12,731 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 05:11:12,732 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 05:11:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1131414096, now seen corresponding path program 1 times [2022-12-06 05:11:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:12,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833004059] [2022-12-06 05:11:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:13,095 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 05:11:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833004059] [2022-12-06 05:11:13,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833004059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:11:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130280237] [2022-12-06 05:11:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:13,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:11:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:11:13,098 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 05:11:13,121 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 05:11:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:13,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:11:13,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:11:13,824 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 05:11:13,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:11:13,892 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 05:11:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130280237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:11:13,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:11:13,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:11:13,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530178769] [2022-12-06 05:11:13,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:11:13,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:11:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:11:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:11:13,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:11:13,900 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 05:11:13,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:13,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:11:13,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:14,301 INFO L130 PetriNetUnfolder]: 133/228 cut-off events. [2022-12-06 05:11:14,301 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 05:11:14,302 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 05:11:14,303 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 31 selfloop transitions, 44 changer transitions 0/75 dead transitions. [2022-12-06 05:11:14,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 536 flow [2022-12-06 05:11:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:11:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:11:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2022-12-06 05:11:14,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13942307692307693 [2022-12-06 05:11:14,305 INFO L175 Difference]: Start difference. First operand has 41 places, 63 transitions, 318 flow. Second operand 16 states and 87 transitions. [2022-12-06 05:11:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 536 flow [2022-12-06 05:11:14,307 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 05:11:14,309 INFO L231 Difference]: Finished difference. Result has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,309 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 05:11:14,310 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 05:11:14,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:14,310 INFO L89 Accepts]: Start accepts. Operand has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:14,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:14,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,345 INFO L130 PetriNetUnfolder]: 16/75 cut-off events. [2022-12-06 05:11:14,345 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:11:14,346 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 05:11:14,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:11:14,347 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:14,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 05:11:14,347 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 462 flow [2022-12-06 05:11:14,348 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 05:11:14,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:14,348 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 05:11:14,359 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 05:11:14,556 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 05:11:14,556 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 05:11:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 925834901, now seen corresponding path program 2 times [2022-12-06 05:11:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365187395] [2022-12-06 05:11:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:15,119 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 05:11:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365187395] [2022-12-06 05:11:15,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365187395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:11:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170715063] [2022-12-06 05:11:15,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:11:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:11:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:11:15,121 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 05:11:15,149 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 05:11:15,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:11:15,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:11:15,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:11:15,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:11:17,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:11:17,310 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 05:11:17,311 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 05:11:18,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:11:18,635 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 05:11:40,596 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 05:11:40,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:11:40,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170715063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:11:40,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:11:40,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 18 [2022-12-06 05:11:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389995514] [2022-12-06 05:11:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:11:40,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:11:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:11:40,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:11:40,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:11:40,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:11:40,598 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 05:11:40,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:11:40,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:11:40,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:11:41,706 INFO L130 PetriNetUnfolder]: 220/360 cut-off events. [2022-12-06 05:11:41,707 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:11:41,707 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 05:11:41,709 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 89 selfloop transitions, 12 changer transitions 7/108 dead transitions. [2022-12-06 05:11:41,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 750 flow [2022-12-06 05:11:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:11:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:11:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 05:11:41,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2022-12-06 05:11:41,710 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 462 flow. Second operand 6 states and 75 transitions. [2022-12-06 05:11:41,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 750 flow [2022-12-06 05:11:41,713 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 05:11:41,714 INFO L231 Difference]: Finished difference. Result has 56 places, 85 transitions, 431 flow [2022-12-06 05:11:41,715 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 05:11:41,715 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2022-12-06 05:11:41,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:11:41,715 INFO L89 Accepts]: Start accepts. Operand has 56 places, 85 transitions, 431 flow [2022-12-06 05:11:41,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:11:41,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:11:41,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 85 transitions, 431 flow [2022-12-06 05:11:41,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 85 transitions, 431 flow [2022-12-06 05:11:41,803 INFO L130 PetriNetUnfolder]: 67/153 cut-off events. [2022-12-06 05:11:41,804 INFO L131 PetriNetUnfolder]: For 21/28 co-relation queries the response was YES. [2022-12-06 05:11:41,804 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 05:11:41,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 85 transitions, 431 flow [2022-12-06 05:11:41,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:11:41,805 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:11:41,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 05:11:41,806 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 85 transitions, 431 flow [2022-12-06 05:11:41,806 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 05:11:41,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:11:41,806 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 05:11:41,814 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 05:11:42,012 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 05:11:42,013 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 05:11:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:11:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1345125183, now seen corresponding path program 3 times [2022-12-06 05:11:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:11:42,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222671684] [2022-12-06 05:11:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:11:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:11:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:11:42,505 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 05:11:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:11:42,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222671684] [2022-12-06 05:11:42,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222671684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:11:42,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882812862] [2022-12-06 05:11:42,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:11:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:11:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:11:42,507 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 05:11:42,534 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 05:11:43,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 05:11:43,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:11:43,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:11:43,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:11:44,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:11:44,403 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 05:12:41,305 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 05:12:41,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:12:41,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882812862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:12:41,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:12:41,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2022-12-06 05:12:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556254580] [2022-12-06 05:12:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:12:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:12:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:12:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:12:41,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:12:41,307 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 05:12:41,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:41,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:12:41,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:41,852 INFO L130 PetriNetUnfolder]: 222/374 cut-off events. [2022-12-06 05:12:41,852 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-06 05:12:41,853 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 05:12:41,854 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 89 selfloop transitions, 12 changer transitions 5/106 dead transitions. [2022-12-06 05:12:41,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 707 flow [2022-12-06 05:12:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:12:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:12:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 05:12:41,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-06 05:12:41,856 INFO L175 Difference]: Start difference. First operand has 55 places, 85 transitions, 431 flow. Second operand 5 states and 73 transitions. [2022-12-06 05:12:41,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 707 flow [2022-12-06 05:12:41,858 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 05:12:41,860 INFO L231 Difference]: Finished difference. Result has 59 places, 85 transitions, 462 flow [2022-12-06 05:12:41,860 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 05:12:41,860 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-06 05:12:41,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:41,861 INFO L89 Accepts]: Start accepts. Operand has 59 places, 85 transitions, 462 flow [2022-12-06 05:12:41,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:41,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:41,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 85 transitions, 462 flow [2022-12-06 05:12:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 85 transitions, 462 flow [2022-12-06 05:12:41,952 INFO L130 PetriNetUnfolder]: 69/159 cut-off events. [2022-12-06 05:12:41,952 INFO L131 PetriNetUnfolder]: For 71/116 co-relation queries the response was YES. [2022-12-06 05:12:41,953 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 05:12:41,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 85 transitions, 462 flow [2022-12-06 05:12:41,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:12:42,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:12:42,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-06 05:12:42,178 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 85 transitions, 462 flow [2022-12-06 05:12:42,178 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 05:12:42,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:42,178 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 05:12:42,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:12:42,387 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 05:12:42,387 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 05:12:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1510930424, now seen corresponding path program 1 times [2022-12-06 05:12:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:42,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944899205] [2022-12-06 05:12:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:42,762 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 05:12:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:42,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944899205] [2022-12-06 05:12:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944899205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:12:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713601769] [2022-12-06 05:12:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:42,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:12:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:12:42,764 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 05:12:42,771 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 05:12:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:43,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:12:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:12:43,469 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 05:12:43,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:12:43,559 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 05:12:43,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713601769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:12:43,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:12:43,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 05:12:43,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851148149] [2022-12-06 05:12:43,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:12:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:12:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:43,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:12:43,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2022-12-06 05:12:43,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:12:43,563 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 05:12:43,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:43,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:12:43,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:44,066 INFO L130 PetriNetUnfolder]: 226/397 cut-off events. [2022-12-06 05:12:44,067 INFO L131 PetriNetUnfolder]: For 335/335 co-relation queries the response was YES. [2022-12-06 05:12:44,067 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 05:12:44,069 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 41 selfloop transitions, 58 changer transitions 0/99 dead transitions. [2022-12-06 05:12:44,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 744 flow [2022-12-06 05:12:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:12:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:12:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-12-06 05:12:44,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18864468864468864 [2022-12-06 05:12:44,071 INFO L175 Difference]: Start difference. First operand has 59 places, 85 transitions, 462 flow. Second operand 14 states and 103 transitions. [2022-12-06 05:12:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 744 flow [2022-12-06 05:12:44,072 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 05:12:44,074 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,074 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 05:12:44,075 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2022-12-06 05:12:44,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:44,075 INFO L89 Accepts]: Start accepts. Operand has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:44,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:44,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,168 INFO L130 PetriNetUnfolder]: 70/181 cut-off events. [2022-12-06 05:12:44,168 INFO L131 PetriNetUnfolder]: For 117/162 co-relation queries the response was YES. [2022-12-06 05:12:44,168 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 05:12:44,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:12:44,170 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:12:44,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 05:12:44,170 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 747 flow [2022-12-06 05:12:44,171 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 05:12:44,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:44,171 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 05:12:44,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:12:44,371 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 05:12:44,371 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 05:12:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1847496726, now seen corresponding path program 1 times [2022-12-06 05:12:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311514842] [2022-12-06 05:12:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:44,755 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 05:12:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311514842] [2022-12-06 05:12:44,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311514842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:12:44,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:12:44,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:12:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101103876] [2022-12-06 05:12:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:12:44,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:12:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:12:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:12:44,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:12:44,757 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 05:12:44,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:44,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:12:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:45,221 INFO L130 PetriNetUnfolder]: 255/454 cut-off events. [2022-12-06 05:12:45,222 INFO L131 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-12-06 05:12:45,223 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 05:12:45,225 INFO L137 encePairwiseOnDemand]: 32/39 looper letters, 117 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2022-12-06 05:12:45,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 1072 flow [2022-12-06 05:12:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:12:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:12:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 05:12:45,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2022-12-06 05:12:45,227 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 747 flow. Second operand 3 states and 58 transitions. [2022-12-06 05:12:45,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 1072 flow [2022-12-06 05:12:45,232 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 05:12:45,237 INFO L231 Difference]: Finished difference. Result has 76 places, 102 transitions, 727 flow [2022-12-06 05:12:45,238 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 05:12:45,240 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2022-12-06 05:12:45,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:45,241 INFO L89 Accepts]: Start accepts. Operand has 76 places, 102 transitions, 727 flow [2022-12-06 05:12:45,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:45,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:45,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 102 transitions, 727 flow [2022-12-06 05:12:45,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 727 flow [2022-12-06 05:12:45,361 INFO L130 PetriNetUnfolder]: 85/223 cut-off events. [2022-12-06 05:12:45,361 INFO L131 PetriNetUnfolder]: For 186/193 co-relation queries the response was YES. [2022-12-06 05:12:45,362 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 05:12:45,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 727 flow [2022-12-06 05:12:45,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 05:12:45,366 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 05:12:45,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:12:45,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 05:12:45,464 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 729 flow [2022-12-06 05:12:45,464 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 05:12:45,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:45,464 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 05:12:45,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:12:45,464 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 05:12:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1316073821, now seen corresponding path program 2 times [2022-12-06 05:12:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:45,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466268019] [2022-12-06 05:12:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:46,096 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 05:12:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466268019] [2022-12-06 05:12:46,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466268019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:12:46,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274034286] [2022-12-06 05:12:46,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:12:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:12:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:12:46,099 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 05:12:46,101 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 05:12:46,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:12:46,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:12:46,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 05:12:46,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:12:47,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:12:47,547 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 05:12:47,548 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 05:12:48,067 INFO L321 Elim1Store]: treesize reduction 348, result has 0.3 percent of original size [2022-12-06 05:12:48,068 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 05:12:48,128 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 05:12:48,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:12:48,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274034286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:12:48,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:12:48,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 25 [2022-12-06 05:12:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844984101] [2022-12-06 05:12:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:12:48,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:12:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:12:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:12:48,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:12:48,130 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 05:12:48,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:48,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:12:48,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:48,896 INFO L130 PetriNetUnfolder]: 217/424 cut-off events. [2022-12-06 05:12:48,896 INFO L131 PetriNetUnfolder]: For 433/433 co-relation queries the response was YES. [2022-12-06 05:12:48,897 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 05:12:48,898 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 122 selfloop transitions, 12 changer transitions 1/135 dead transitions. [2022-12-06 05:12:48,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1116 flow [2022-12-06 05:12:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:12:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:12:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 05:12:48,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-06 05:12:48,899 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 729 flow. Second operand 5 states and 74 transitions. [2022-12-06 05:12:48,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1116 flow [2022-12-06 05:12:48,904 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 05:12:48,906 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 784 flow [2022-12-06 05:12:48,906 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 05:12:48,906 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2022-12-06 05:12:48,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:48,906 INFO L89 Accepts]: Start accepts. Operand has 81 places, 106 transitions, 784 flow [2022-12-06 05:12:48,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:48,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:48,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 106 transitions, 784 flow [2022-12-06 05:12:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 106 transitions, 784 flow [2022-12-06 05:12:48,996 INFO L130 PetriNetUnfolder]: 68/202 cut-off events. [2022-12-06 05:12:48,997 INFO L131 PetriNetUnfolder]: For 251/260 co-relation queries the response was YES. [2022-12-06 05:12:48,997 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 05:12:48,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 106 transitions, 784 flow [2022-12-06 05:12:48,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 05:12:49,001 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 05:12:50,203 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 05:12:52,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:12:52,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3533 [2022-12-06 05:12:52,439 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 106 transitions, 798 flow [2022-12-06 05:12:52,439 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 05:12:52,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:52,439 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 05:12:52,446 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 05:12:52,643 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 05:12:52,644 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 05:12:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1526157727, now seen corresponding path program 1 times [2022-12-06 05:12:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:52,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683481274] [2022-12-06 05:12:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:53,243 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 05:12:53,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:53,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683481274] [2022-12-06 05:12:53,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683481274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:12:53,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750120553] [2022-12-06 05:12:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:53,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:12:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:12:53,248 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 05:12:53,251 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 05:12:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:53,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:12:53,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:12:54,087 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 05:12:54,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:12:54,186 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 05:12:54,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750120553] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:12:54,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:12:54,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2022-12-06 05:12:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982825269] [2022-12-06 05:12:54,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:12:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 05:12:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 05:12:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=484, Unknown=0, NotChecked=0, Total=812 [2022-12-06 05:12:54,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:12:54,188 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 05:12:54,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:54,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:12:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:54,619 INFO L130 PetriNetUnfolder]: 210/413 cut-off events. [2022-12-06 05:12:54,619 INFO L131 PetriNetUnfolder]: For 720/720 co-relation queries the response was YES. [2022-12-06 05:12:54,620 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 05:12:54,622 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 48 selfloop transitions, 60 changer transitions 0/108 dead transitions. [2022-12-06 05:12:54,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 108 transitions, 1030 flow [2022-12-06 05:12:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 05:12:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 05:12:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 94 transitions. [2022-12-06 05:12:54,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1175 [2022-12-06 05:12:54,623 INFO L175 Difference]: Start difference. First operand has 80 places, 106 transitions, 798 flow. Second operand 20 states and 94 transitions. [2022-12-06 05:12:54,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 108 transitions, 1030 flow [2022-12-06 05:12:54,628 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 05:12:54,630 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,631 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 05:12:54,631 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2022-12-06 05:12:54,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:54,631 INFO L89 Accepts]: Start accepts. Operand has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:54,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:54,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,742 INFO L130 PetriNetUnfolder]: 65/205 cut-off events. [2022-12-06 05:12:54,742 INFO L131 PetriNetUnfolder]: For 237/251 co-relation queries the response was YES. [2022-12-06 05:12:54,743 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 05:12:54,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 05:12:54,745 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:12:54,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 05:12:54,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 934 flow [2022-12-06 05:12:54,746 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 05:12:54,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:54,746 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 05:12:54,755 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 05:12:54,954 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 05:12:54,955 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 05:12:54,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -713421214, now seen corresponding path program 2 times [2022-12-06 05:12:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:54,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494489472] [2022-12-06 05:12:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:55,320 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 05:12:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494489472] [2022-12-06 05:12:55,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494489472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:12:55,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:12:55,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:12:55,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181047934] [2022-12-06 05:12:55,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:12:55,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:12:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:55,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:12:55,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:12:55,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:12:55,323 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 05:12:55,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:55,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:12:55,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:55,711 INFO L130 PetriNetUnfolder]: 195/409 cut-off events. [2022-12-06 05:12:55,711 INFO L131 PetriNetUnfolder]: For 536/536 co-relation queries the response was YES. [2022-12-06 05:12:55,713 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 05:12:55,715 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 114 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2022-12-06 05:12:55,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 1204 flow [2022-12-06 05:12:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:12:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:12:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 05:12:55,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 05:12:55,717 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 934 flow. Second operand 3 states and 56 transitions. [2022-12-06 05:12:55,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 1204 flow [2022-12-06 05:12:55,722 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 05:12:55,724 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,724 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 05:12:55,725 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2022-12-06 05:12:55,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:55,725 INFO L89 Accepts]: Start accepts. Operand has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:55,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:55,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,810 INFO L130 PetriNetUnfolder]: 55/204 cut-off events. [2022-12-06 05:12:55,810 INFO L131 PetriNetUnfolder]: For 282/294 co-relation queries the response was YES. [2022-12-06 05:12:55,810 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 05:12:55,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 05:12:55,812 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:12:55,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 05:12:55,813 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 747 flow [2022-12-06 05:12:55,813 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 05:12:55,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:55,813 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 05:12:55,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:12:55,813 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 05:12:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1506558513, now seen corresponding path program 1 times [2022-12-06 05:12:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:55,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027510222] [2022-12-06 05:12:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:12:56,084 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 05:12:56,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:12:56,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027510222] [2022-12-06 05:12:56,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027510222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:12:56,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:12:56,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:12:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049117627] [2022-12-06 05:12:56,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:12:56,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:12:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:12:56,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:12:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:12:56,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:12:56,087 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 05:12:56,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:12:56,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:12:56,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:12:56,417 INFO L130 PetriNetUnfolder]: 176/374 cut-off events. [2022-12-06 05:12:56,417 INFO L131 PetriNetUnfolder]: For 656/656 co-relation queries the response was YES. [2022-12-06 05:12:56,418 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 05:12:56,420 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 112 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2022-12-06 05:12:56,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1015 flow [2022-12-06 05:12:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:12:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:12:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 05:12:56,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-06 05:12:56,421 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 747 flow. Second operand 3 states and 53 transitions. [2022-12-06 05:12:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1015 flow [2022-12-06 05:12:56,425 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 05:12:56,427 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,427 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 05:12:56,428 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2022-12-06 05:12:56,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:12:56,428 INFO L89 Accepts]: Start accepts. Operand has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:12:56,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:12:56,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,542 INFO L130 PetriNetUnfolder]: 52/192 cut-off events. [2022-12-06 05:12:56,543 INFO L131 PetriNetUnfolder]: For 255/264 co-relation queries the response was YES. [2022-12-06 05:12:56,544 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 05:12:56,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 05:12:56,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:12:56,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 05:12:56,546 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 738 flow [2022-12-06 05:12:56,546 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 05:12:56,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:12:56,546 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 05:12:56,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:12:56,546 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 05:12:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:12:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 453761400, now seen corresponding path program 1 times [2022-12-06 05:12:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:12:56,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709025886] [2022-12-06 05:12:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:12:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:12:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:13:04,819 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 05:13:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:13:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709025886] [2022-12-06 05:13:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709025886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:13:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046043765] [2022-12-06 05:13:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:13:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:13:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:13:04,824 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 05:13:04,830 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 05:13:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:13:05,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 05:13:05,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:13:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:05,547 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-12-06 05:13:05,548 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 05:13:05,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:05,605 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-06 05:13:05,605 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 05:13:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:07,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:07,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:07,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:07,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:07,206 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-06 05:13:07,207 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 05:13:07,692 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 05:13:07,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:13:07,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046043765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:13:07,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:13:07,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 33 [2022-12-06 05:13:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479697887] [2022-12-06 05:13:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:13:07,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:13:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:13:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:13:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2022-12-06 05:13:07,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:13:07,694 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 05:13:07,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:13:07,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:13:07,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:13:08,614 INFO L130 PetriNetUnfolder]: 168/358 cut-off events. [2022-12-06 05:13:08,615 INFO L131 PetriNetUnfolder]: For 587/587 co-relation queries the response was YES. [2022-12-06 05:13:08,616 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 05:13:08,617 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 102 selfloop transitions, 12 changer transitions 0/114 dead transitions. [2022-12-06 05:13:08,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 114 transitions, 1005 flow [2022-12-06 05:13:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:13:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:13:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-12-06 05:13:08,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1275 [2022-12-06 05:13:08,619 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 738 flow. Second operand 10 states and 51 transitions. [2022-12-06 05:13:08,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 114 transitions, 1005 flow [2022-12-06 05:13:08,623 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 05:13:08,625 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,625 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 05:13:08,626 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2022-12-06 05:13:08,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:13:08,626 INFO L89 Accepts]: Start accepts. Operand has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:13:08,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:13:08,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,730 INFO L130 PetriNetUnfolder]: 50/184 cut-off events. [2022-12-06 05:13:08,730 INFO L131 PetriNetUnfolder]: For 326/334 co-relation queries the response was YES. [2022-12-06 05:13:08,731 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 05:13:08,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 05:13:08,733 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:13:08,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:13:08,733 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 777 flow [2022-12-06 05:13:08,733 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 05:13:08,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:13:08,734 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 05:13:08,752 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 05:13:08,949 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 05:13:08,951 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 05:13:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:13:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1675246654, now seen corresponding path program 1 times [2022-12-06 05:13:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:13:08,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103067492] [2022-12-06 05:13:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:13:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:13:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:13:09,953 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 05:13:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:13:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103067492] [2022-12-06 05:13:09,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103067492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:13:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543025255] [2022-12-06 05:13:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:13:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:13:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:13:09,955 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 05:13:09,979 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 05:13:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:13:10,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:13:10,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:13:10,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:10,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:13:10,901 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:13:10,901 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 05:13:11,322 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 05:13:11,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:16:07,548 WARN L233 SmtUtils]: Spent 2.93m 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 05:16:07,757 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 05:16:08,439 INFO L321 Elim1Store]: treesize reduction 11, result has 97.4 percent of original size [2022-12-06 05:16:08,440 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 05:16:08,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:08,564 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 05:16:08,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:08,627 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 05:16:08,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:08,681 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 05:16:08,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:08,765 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 05:16:08,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:08,867 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 05:17:31,698 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 05:17:31,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543025255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:17:31,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:17:31,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:17:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414794016] [2022-12-06 05:17:31,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:17:31,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:17:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:17:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2022-12-06 05:17:31,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:17:31,701 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 05:17:31,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:31,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:17:31,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:32,089 INFO L130 PetriNetUnfolder]: 120/272 cut-off events. [2022-12-06 05:17:32,090 INFO L131 PetriNetUnfolder]: For 737/737 co-relation queries the response was YES. [2022-12-06 05:17:32,091 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 05:17:32,092 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 102 selfloop transitions, 2 changer transitions 3/107 dead transitions. [2022-12-06 05:17:32,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 955 flow [2022-12-06 05:17:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:17:32,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30625 [2022-12-06 05:17:32,093 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 777 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:17:32,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 955 flow [2022-12-06 05:17:32,097 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 05:17:32,099 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 679 flow [2022-12-06 05:17:32,100 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 05:17:32,100 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2022-12-06 05:17:32,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:32,100 INFO L89 Accepts]: Start accepts. Operand has 89 places, 98 transitions, 679 flow [2022-12-06 05:17:32,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:32,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:32,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 98 transitions, 679 flow [2022-12-06 05:17:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 98 transitions, 679 flow [2022-12-06 05:17:32,159 INFO L130 PetriNetUnfolder]: 34/135 cut-off events. [2022-12-06 05:17:32,159 INFO L131 PetriNetUnfolder]: For 170/172 co-relation queries the response was YES. [2022-12-06 05:17:32,160 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 05:17:32,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 98 transitions, 679 flow [2022-12-06 05:17:32,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 05:17:32,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:32,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 05:17:32,161 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 679 flow [2022-12-06 05:17:32,161 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 05:17:32,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:32,162 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 05:17:32,170 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 05:17:32,362 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 05:17:32,362 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 05:17:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash 830225107, now seen corresponding path program 1 times [2022-12-06 05:17:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:32,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943752018] [2022-12-06 05:17:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:32,660 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 05:17:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:32,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943752018] [2022-12-06 05:17:32,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943752018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:32,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:32,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:17:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198356475] [2022-12-06 05:17:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:32,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:17:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:17:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:17:32,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:17:32,662 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 05:17:32,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:32,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:17:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:32,897 INFO L130 PetriNetUnfolder]: 109/248 cut-off events. [2022-12-06 05:17:32,898 INFO L131 PetriNetUnfolder]: For 362/362 co-relation queries the response was YES. [2022-12-06 05:17:32,899 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 05:17:32,900 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 102 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2022-12-06 05:17:32,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 912 flow [2022-12-06 05:17:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:17:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:17:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:17:32,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 05:17:32,902 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 679 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:17:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 912 flow [2022-12-06 05:17:32,906 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 05:17:32,907 INFO L231 Difference]: Finished difference. Result has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,907 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 05:17:32,908 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2022-12-06 05:17:32,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:32,908 INFO L89 Accepts]: Start accepts. Operand has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:32,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:32,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,991 INFO L130 PetriNetUnfolder]: 35/138 cut-off events. [2022-12-06 05:17:32,992 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-06 05:17:32,992 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 05:17:32,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 05:17:32,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:32,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 05:17:32,994 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 98 transitions, 675 flow [2022-12-06 05:17:32,994 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 05:17:32,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:32,994 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 05:17:32,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:17:32,995 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 05:17:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 334671440, now seen corresponding path program 1 times [2022-12-06 05:17:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:32,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132105379] [2022-12-06 05:17:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:33,250 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 05:17:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:33,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132105379] [2022-12-06 05:17:33,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132105379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:33,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:33,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:17:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542712970] [2022-12-06 05:17:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:33,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:17:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:17:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:17:33,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:17:33,252 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 05:17:33,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:33,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:17:33,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:33,495 INFO L130 PetriNetUnfolder]: 115/260 cut-off events. [2022-12-06 05:17:33,495 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-06 05:17:33,496 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 05:17:33,497 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 102 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2022-12-06 05:17:33,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 908 flow [2022-12-06 05:17:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:17:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:17:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:17:33,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 05:17:33,498 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 675 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:17:33,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 908 flow [2022-12-06 05:17:33,502 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 05:17:33,503 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,503 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 05:17:33,504 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2022-12-06 05:17:33,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:33,505 INFO L89 Accepts]: Start accepts. Operand has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:33,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:33,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,566 INFO L130 PetriNetUnfolder]: 32/135 cut-off events. [2022-12-06 05:17:33,566 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 05:17:33,567 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 05:17:33,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 05:17:33,568 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:33,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 05:17:33,568 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 684 flow [2022-12-06 05:17:33,568 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 05:17:33,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:33,569 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 05:17:33,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:17:33,569 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 05:17:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 819061867, now seen corresponding path program 1 times [2022-12-06 05:17:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:33,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350304604] [2022-12-06 05:17:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:42,915 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 05:17:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350304604] [2022-12-06 05:17:42,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350304604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:17:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531367758] [2022-12-06 05:17:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:17:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:17:42,918 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 05:17:42,921 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 05:17:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:43,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 05:17:43,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:17:48,502 INFO L321 Elim1Store]: treesize reduction 12, result has 96.0 percent of original size [2022-12-06 05:17:48,502 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 05:17:48,854 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 05:17:48,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:55,232 WARN L233 SmtUtils]: Spent 47.09s 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 05:18:55,240 INFO L321 Elim1Store]: treesize reduction 11, result has 99.8 percent of original size [2022-12-06 05:18:55,241 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 05:23:23,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:23:23,261 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 05:23:23,263 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 05:23:23,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:23:23,471 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 05:23:23,472 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 75 with TraceHistMax 13,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 21 xjuncts wrt. a ∧-614-4-6-2-5-3-4-4-3-2-2-3-2-1 context. [2022-12-06 05:23:23,473 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:23:23,473 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:23:23,473 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:23,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:23:23,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:23:23,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:23:23 BasicIcfg [2022-12-06 05:23:23,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:23:23,479 INFO L158 Benchmark]: Toolchain (without parser) took 785717.36ms. Allocated memory was 184.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 160.6MB in the beginning and 1.0GB in the end (delta: -881.5MB). Peak memory consumption was 928.6MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,480 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:23:23,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.09ms. Allocated memory is still 184.5MB. Free memory was 160.2MB in the beginning and 134.1MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.05ms. Allocated memory is still 184.5MB. Free memory was 134.1MB in the beginning and 159.7MB in the end (delta: -25.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,480 INFO L158 Benchmark]: Boogie Preprocessor took 99.26ms. Allocated memory is still 184.5MB. Free memory was 159.7MB in the beginning and 152.4MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,481 INFO L158 Benchmark]: RCFGBuilder took 3170.42ms. Allocated memory was 184.5MB in the beginning and 311.4MB in the end (delta: 126.9MB). Free memory was 152.4MB in the beginning and 252.0MB in the end (delta: -99.6MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,481 INFO L158 Benchmark]: TraceAbstraction took 781933.00ms. Allocated memory was 311.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 250.9MB in the beginning and 1.0GB in the end (delta: -791.2MB). Peak memory consumption was 891.9MB. Max. memory is 8.0GB. [2022-12-06 05:23:23,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 386.09ms. Allocated memory is still 184.5MB. Free memory was 160.2MB in the beginning and 134.1MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 123.05ms. Allocated memory is still 184.5MB. Free memory was 134.1MB in the beginning and 159.7MB in the end (delta: -25.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.26ms. Allocated memory is still 184.5MB. Free memory was 159.7MB in the beginning and 152.4MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 3170.42ms. Allocated memory was 184.5MB in the beginning and 311.4MB in the end (delta: 126.9MB). Free memory was 152.4MB in the beginning and 252.0MB in the end (delta: -99.6MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. * TraceAbstraction took 781933.00ms. Allocated memory was 311.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 250.9MB in the beginning and 1.0GB in the end (delta: -791.2MB). Peak memory consumption was 891.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.4s, 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: 73, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 73, dependent conditional: 0, dependent unconditional: 73, 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.4s, 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 PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 21 xjuncts wrt. a ∧-614-4-6-2-5-3-4-4-3-2-2-3-2-1 context. - 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 PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 21 xjuncts wrt. a ∧-614-4-6-2-5-3-4-4-3-2-2-3-2-1 context. - 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 PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 21 xjuncts wrt. a ∧-614-4-6-2-5-3-4-4-3-2-2-3-2-1 context. - 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: 781.6s, OverallIterations: 17, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 863 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.3s 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, 179.3s 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.7s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 360.4s 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