/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/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:29:48,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:29:48,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:29:48,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:29:48,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:29:48,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:29:48,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:29:48,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:29:48,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:29:48,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:29:48,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:29:48,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:29:48,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:29:48,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:29:48,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:29:48,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:29:48,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:29:48,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:29:48,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:29:48,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:29:48,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:29:48,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:29:48,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:29:48,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:29:48,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:29:48,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:29:48,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:29:48,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:29:48,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:29:48,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:29:48,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:29:48,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:29:48,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:29:48,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:29:48,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:29:48,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:29:48,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:29:48,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:29:48,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:29:48,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:29:48,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:29:48,888 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:29:48,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:29:48,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:29:48,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:29:48,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:29:48,904 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:29:48,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:29:48,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:29:48,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:29:48,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:29:48,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:29:48,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:29:48,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:29:48,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:29:48,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:29:48,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:29:48,907 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:29:49,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:29:49,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:29:49,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:29:49,272 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:29:49,272 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:29:49,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-06 05:29:50,324 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:29:50,505 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:29:50,506 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-12-06 05:29:50,511 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a84e8b5/38a0f9b62b4644009d188e5ecaeecfd8/FLAG16c86d664 [2022-12-06 05:29:50,892 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a84e8b5/38a0f9b62b4644009d188e5ecaeecfd8 [2022-12-06 05:29:50,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:29:50,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:29:50,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:29:50,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:29:50,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:29:50,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:29:50" (1/1) ... [2022-12-06 05:29:50,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cbdb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:50, skipping insertion in model container [2022-12-06 05:29:50,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:29:50" (1/1) ... [2022-12-06 05:29:50,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:29:50,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:29:51,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,123 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/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-06 05:29:51,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:29:51,146 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:29:51,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:29:51,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:29:51,183 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/popl20-min-max-inc.wvr.c[3018,3031] [2022-12-06 05:29:51,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:29:51,194 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:29:51,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51 WrapperNode [2022-12-06 05:29:51,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:29:51,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:29:51,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:29:51,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:29:51,201 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:29:51" (1/1) ... [2022-12-06 05:29:51,216 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:29:51" (1/1) ... [2022-12-06 05:29:51,240 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-06 05:29:51,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:29:51,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:29:51,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:29:51,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:29:51,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:29:51,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:29:51,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:29:51,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:29:51,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (1/1) ... [2022-12-06 05:29:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:29:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:29:51,330 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:29:51,350 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:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:29:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:29:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:29:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:29:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:29:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:29:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:29:51,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:29:51,364 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:29:51,503 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:29:51,505 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:29:51,809 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:29:51,900 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:29:51,900 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:29:51,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:29:51 BoogieIcfgContainer [2022-12-06 05:29:51,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:29:51,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:29:51,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:29:51,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:29:51,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:29:50" (1/3) ... [2022-12-06 05:29:51,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60949b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:29:51, skipping insertion in model container [2022-12-06 05:29:51,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:51" (2/3) ... [2022-12-06 05:29:51,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60949b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:29:51, skipping insertion in model container [2022-12-06 05:29:51,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:29:51" (3/3) ... [2022-12-06 05:29:51,906 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-12-06 05:29:51,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:29:51,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:29:51,917 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:29:52,001 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 05:29:52,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 352 flow [2022-12-06 05:29:52,097 INFO L130 PetriNetUnfolder]: 12/156 cut-off events. [2022-12-06 05:29:52,097 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:29:52,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 12/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 05:29:52,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 352 flow [2022-12-06 05:29:52,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 312 flow [2022-12-06 05:29:52,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:52,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-06 05:29:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-06 05:29:52,190 INFO L130 PetriNetUnfolder]: 12/144 cut-off events. [2022-12-06 05:29:52,190 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:29:52,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 144 events. 12/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 05:29:52,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-06 05:29:52,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-06 05:29:58,117 INFO L203 LiptonReduction]: Total number of compositions: 113 [2022-12-06 05:29:58,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:29:58,132 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;@67573168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:29:58,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 05:29:58,138 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-06 05:29:58,138 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:29:58,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:58,138 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, 1, 1] [2022-12-06 05:29:58,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:29:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1695043003, now seen corresponding path program 1 times [2022-12-06 05:29:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:58,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023287477] [2022-12-06 05:29:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:58,503 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:29:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:58,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023287477] [2022-12-06 05:29:58,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023287477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:58,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:58,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048654609] [2022-12-06 05:29:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:58,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:29:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:29:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:29:58,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:29:58,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:29:58,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:58,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:29:58,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:58,749 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2022-12-06 05:29:58,750 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-06 05:29:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7133 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2022-12-06 05:29:58,765 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:29:58,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2022-12-06 05:29:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:29:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:29:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 05:29:58,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-06 05:29:58,775 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 50 transitions. [2022-12-06 05:29:58,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2022-12-06 05:29:58,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 05:29:58,781 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-06 05:29:58,786 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-06 05:29:58,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:58,787 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:58,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:58,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,796 INFO L130 PetriNetUnfolder]: 4/32 cut-off events. [2022-12-06 05:29:58,796 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:29:58,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2022-12-06 05:29:58,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 05:29:58,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:58,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:29:58,818 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2022-12-06 05:29:58,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:29:58,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:58,818 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, 1, 1, 1] [2022-12-06 05:29:58,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:29:58,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:29:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1731643137, now seen corresponding path program 1 times [2022-12-06 05:29:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:58,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861344938] [2022-12-06 05:29:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:29:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:58,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861344938] [2022-12-06 05:29:58,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861344938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:58,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:58,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571440403] [2022-12-06 05:29:58,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:58,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:29:58,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:58,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:29:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:29:58,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:29:58,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.0) 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:29:58,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:58,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:29:58,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:59,079 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2022-12-06 05:29:59,079 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-06 05:29:59,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8137 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2022-12-06 05:29:59,089 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-06 05:29:59,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2022-12-06 05:29:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:29:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:29:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 05:29:59,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-06 05:29:59,090 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 49 transitions. [2022-12-06 05:29:59,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2022-12-06 05:29:59,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:29:59,092 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-06 05:29:59,093 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-06 05:29:59,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:59,093 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:59,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:59,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,097 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-06 05:29:59,097 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:29:59,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-06 05:29:59,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 05:29:59,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:29:59,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 05:29:59,172 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 88 flow [2022-12-06 05:29:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) 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:29:59,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:59,172 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, 1, 1, 1] [2022-12-06 05:29:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:29:59,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:29:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1115120276, now seen corresponding path program 1 times [2022-12-06 05:29:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640949273] [2022-12-06 05:29:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:29:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:59,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640949273] [2022-12-06 05:29:59,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640949273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:59,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:59,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:29:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673617839] [2022-12-06 05:29:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:59,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:29:59,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:29:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:29:59,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:29:59,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.0) 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:29:59,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:59,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:29:59,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:59,414 INFO L130 PetriNetUnfolder]: 1632/2222 cut-off events. [2022-12-06 05:29:59,414 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 05:29:59,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 2222 events. 1632/2222 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7613 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1664. Up to 1790 conditions per place. [2022-12-06 05:29:59,422 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-12-06 05:29:59,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 237 flow [2022-12-06 05:29:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:29:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:29:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:29:59,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 05:29:59,423 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 88 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:29:59,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 237 flow [2022-12-06 05:29:59,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:29:59,426 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-06 05:29:59,426 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-06 05:29:59,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:59,427 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:59,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:59,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,432 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-06 05:29:59,432 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:29:59,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 4/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-06 05:29:59,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 05:29:59,441 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:29:59,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:29:59,442 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2022-12-06 05:29:59,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) 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:29:59,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:29:59,443 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, 1, 1, 1, 1] [2022-12-06 05:29:59,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:29:59,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:29:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:29:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1272676707, now seen corresponding path program 1 times [2022-12-06 05:29:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:29:59,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012674590] [2022-12-06 05:29:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:29:59,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:29:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:29:59,511 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:29:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:29:59,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012674590] [2022-12-06 05:29:59,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012674590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:29:59,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:29:59,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:29:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694911764] [2022-12-06 05:29:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:29:59,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:29:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:29:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:29:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:29:59,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:29:59,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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:29:59,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:29:59,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:29:59,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:59,678 INFO L130 PetriNetUnfolder]: 1632/2223 cut-off events. [2022-12-06 05:29:59,678 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 05:29:59,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 2223 events. 1632/2223 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7381 event pairs, 1243 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 1727. Up to 2223 conditions per place. [2022-12-06 05:29:59,686 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 05:29:59,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 162 flow [2022-12-06 05:29:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:29:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:29:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 05:29:59,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-06 05:29:59,687 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-06 05:29:59,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 162 flow [2022-12-06 05:29:59,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 156 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:29:59,689 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 98 flow [2022-12-06 05:29:59,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 05:29:59,690 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-12-06 05:29:59,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:29:59,690 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 98 flow [2022-12-06 05:29:59,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:29:59,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:29:59,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-06 05:29:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 98 flow [2022-12-06 05:29:59,694 INFO L130 PetriNetUnfolder]: 4/34 cut-off events. [2022-12-06 05:29:59,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:29:59,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 34 events. 4/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-06 05:29:59,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 98 flow [2022-12-06 05:29:59,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 05:30:00,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:30:00,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1128 [2022-12-06 05:30:00,818 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2022-12-06 05:30:00,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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:30:00,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:00,818 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, 1, 1, 1, 1] [2022-12-06 05:30:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:30:00,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:30:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -922744889, now seen corresponding path program 1 times [2022-12-06 05:30:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:00,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296546984] [2022-12-06 05:30:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:30:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:01,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296546984] [2022-12-06 05:30:01,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296546984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:30:01,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544257433] [2022-12-06 05:30:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:01,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:30:01,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:30:01,585 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:30:01,665 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:30:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:01,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 05:30:01,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:30:01,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:30:01,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:30:01,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:30:01,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:30:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:30:01,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:30:02,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:30:02,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-06 05:30:02,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-12-06 05:30:02,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-12-06 05:30:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:02,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:30:02,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) is different from false [2022-12-06 05:30:03,199 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< c_~min~0 (+ 3 .cse0))))) (not (< c_~min~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 3 .cse3)) (< 2147483645 .cse3))))))))) is different from false [2022-12-06 05:30:03,231 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (< 2147483645 .cse0) (< .cse1 (+ 4 .cse0)) (< .cse1 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) (+ 3 .cse4)) (< 2147483645 .cse4)))))) is different from false [2022-12-06 05:30:03,270 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse0) (< .cse1 (+ .cse0 4)) (< .cse1 (+ (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483645 .cse4) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse4 3))))))) is different from false [2022-12-06 05:30:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:03,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544257433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:30:03,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:30:03,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 33 [2022-12-06 05:30:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914564748] [2022-12-06 05:30:03,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:30:03,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 05:30:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 05:30:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=794, Unknown=23, NotChecked=244, Total=1190 [2022-12-06 05:30:03,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:30:03,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 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:30:03,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:03,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:30:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:12,060 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 71 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:20,320 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:29,169 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 91 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:38,429 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 73 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:46,884 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 75 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:55,043 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 93 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:30:56,362 INFO L130 PetriNetUnfolder]: 9238/12748 cut-off events. [2022-12-06 05:30:56,362 INFO L131 PetriNetUnfolder]: For 2165/2165 co-relation queries the response was YES. [2022-12-06 05:30:56,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30254 conditions, 12748 events. 9238/12748 cut-off events. For 2165/2165 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 64461 event pairs, 150 based on Foata normal form. 8/9943 useless extension candidates. Maximal degree in co-relation 30244. Up to 2567 conditions per place. [2022-12-06 05:30:56,432 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 235 selfloop transitions, 64 changer transitions 297/596 dead transitions. [2022-12-06 05:30:56,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 596 transitions, 2783 flow [2022-12-06 05:30:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 05:30:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 05:30:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 582 transitions. [2022-12-06 05:30:56,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2022-12-06 05:30:56,435 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 42 states and 582 transitions. [2022-12-06 05:30:56,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 596 transitions, 2783 flow [2022-12-06 05:30:56,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 596 transitions, 2775 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:30:56,459 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 671 flow [2022-12-06 05:30:56,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=671, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2022-12-06 05:30:56,460 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2022-12-06 05:30:56,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:56,460 INFO L89 Accepts]: Start accepts. Operand has 103 places, 119 transitions, 671 flow [2022-12-06 05:30:56,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:56,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:56,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 119 transitions, 671 flow [2022-12-06 05:30:56,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 119 transitions, 671 flow [2022-12-06 05:30:56,513 INFO L130 PetriNetUnfolder]: 329/834 cut-off events. [2022-12-06 05:30:56,513 INFO L131 PetriNetUnfolder]: For 2977/3185 co-relation queries the response was YES. [2022-12-06 05:30:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 834 events. 329/834 cut-off events. For 2977/3185 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5337 event pairs, 2 based on Foata normal form. 2/809 useless extension candidates. Maximal degree in co-relation 2160. Up to 168 conditions per place. [2022-12-06 05:30:56,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 119 transitions, 671 flow [2022-12-06 05:30:56,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 05:30:56,523 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:56,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 05:30:56,523 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 119 transitions, 671 flow [2022-12-06 05:30:56,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 34 states have internal predecessors, (87), 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:30:56,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:56,524 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, 1, 1, 1, 1] [2022-12-06 05:30:56,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:30:56,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:30:56,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:30:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -500927109, now seen corresponding path program 2 times [2022-12-06 05:30:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:56,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440930919] [2022-12-06 05:30:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:56,890 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:30:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:56,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440930919] [2022-12-06 05:30:56,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440930919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:56,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:56,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:30:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062258176] [2022-12-06 05:30:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:56,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:30:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:30:56,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:30:56,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:30:56,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 119 transitions, 671 flow. Second operand has 4 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:30:56,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:56,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:30:56,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:30:57,839 INFO L130 PetriNetUnfolder]: 7586/10590 cut-off events. [2022-12-06 05:30:57,839 INFO L131 PetriNetUnfolder]: For 66345/66345 co-relation queries the response was YES. [2022-12-06 05:30:57,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42474 conditions, 10590 events. 7586/10590 cut-off events. For 66345/66345 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 52213 event pairs, 1083 based on Foata normal form. 8/10597 useless extension candidates. Maximal degree in co-relation 42403. Up to 6483 conditions per place. [2022-12-06 05:30:57,884 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 94 selfloop transitions, 5 changer transitions 190/289 dead transitions. [2022-12-06 05:30:57,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 289 transitions, 2212 flow [2022-12-06 05:30:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:30:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:30:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 05:30:57,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2022-12-06 05:30:57,885 INFO L175 Difference]: Start difference. First operand has 83 places, 119 transitions, 671 flow. Second operand 5 states and 76 transitions. [2022-12-06 05:30:57,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 289 transitions, 2212 flow [2022-12-06 05:30:58,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 289 transitions, 2151 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-12-06 05:30:58,177 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 391 flow [2022-12-06 05:30:58,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2022-12-06 05:30:58,178 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2022-12-06 05:30:58,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:58,178 INFO L89 Accepts]: Start accepts. Operand has 78 places, 75 transitions, 391 flow [2022-12-06 05:30:58,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:58,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:58,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 391 flow [2022-12-06 05:30:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 75 transitions, 391 flow [2022-12-06 05:30:58,200 INFO L130 PetriNetUnfolder]: 145/362 cut-off events. [2022-12-06 05:30:58,201 INFO L131 PetriNetUnfolder]: For 1306/1369 co-relation queries the response was YES. [2022-12-06 05:30:58,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 362 events. 145/362 cut-off events. For 1306/1369 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1759 event pairs, 0 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 1014. Up to 74 conditions per place. [2022-12-06 05:30:58,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 75 transitions, 391 flow [2022-12-06 05:30:58,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 858 [2022-12-06 05:30:58,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:58,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:30:58,205 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 391 flow [2022-12-06 05:30:58,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:30:58,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:58,206 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, 1, 1, 1, 1] [2022-12-06 05:30:58,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:30:58,206 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:30:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1265561741, now seen corresponding path program 3 times [2022-12-06 05:30:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:58,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250354767] [2022-12-06 05:30:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:58,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:30:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:58,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250354767] [2022-12-06 05:30:58,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250354767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:30:58,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13216861] [2022-12-06 05:30:58,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:30:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:30:58,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:30:58,437 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:30:58,439 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:30:58,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 05:30:58,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:30:58,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:30:58,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:30:58,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:30:58,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 05:30:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:30:58,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:30:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:30:58,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13216861] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:30:58,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:30:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 16 [2022-12-06 05:30:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982289150] [2022-12-06 05:30:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:58,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:30:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:58,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:30:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:30:58,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:30:58,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 391 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:30:58,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:58,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:30:58,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:00,101 INFO L130 PetriNetUnfolder]: 9511/13173 cut-off events. [2022-12-06 05:31:00,101 INFO L131 PetriNetUnfolder]: For 98591/98591 co-relation queries the response was YES. [2022-12-06 05:31:00,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54377 conditions, 13173 events. 9511/13173 cut-off events. For 98591/98591 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 67214 event pairs, 1384 based on Foata normal form. 8/13180 useless extension candidates. Maximal degree in co-relation 54333. Up to 4522 conditions per place. [2022-12-06 05:31:00,158 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 123 selfloop transitions, 13 changer transitions 170/306 dead transitions. [2022-12-06 05:31:00,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 306 transitions, 2211 flow [2022-12-06 05:31:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:31:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:31:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 05:31:00,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5668202764976958 [2022-12-06 05:31:00,160 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 391 flow. Second operand 7 states and 123 transitions. [2022-12-06 05:31:00,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 306 transitions, 2211 flow [2022-12-06 05:31:00,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 306 transitions, 2062 flow, removed 60 selfloop flow, removed 14 redundant places. [2022-12-06 05:31:00,376 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 530 flow [2022-12-06 05:31:00,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2022-12-06 05:31:00,377 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-12-06 05:31:00,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:00,377 INFO L89 Accepts]: Start accepts. Operand has 64 places, 86 transitions, 530 flow [2022-12-06 05:31:00,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:00,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:00,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 86 transitions, 530 flow [2022-12-06 05:31:00,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 86 transitions, 530 flow [2022-12-06 05:31:00,441 INFO L130 PetriNetUnfolder]: 554/1238 cut-off events. [2022-12-06 05:31:00,442 INFO L131 PetriNetUnfolder]: For 1692/1741 co-relation queries the response was YES. [2022-12-06 05:31:00,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3679 conditions, 1238 events. 554/1238 cut-off events. For 1692/1741 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7844 event pairs, 44 based on Foata normal form. 8/1212 useless extension candidates. Maximal degree in co-relation 3642. Up to 301 conditions per place. [2022-12-06 05:31:00,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 530 flow [2022-12-06 05:31:00,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-06 05:31:00,451 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:00,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 05:31:00,451 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 86 transitions, 530 flow [2022-12-06 05:31:00,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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:31:00,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:00,452 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, 1, 1, 1, 1] [2022-12-06 05:31:00,457 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:31:00,657 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,SelfDestructingSolverStorable6 [2022-12-06 05:31:00,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -103512581, now seen corresponding path program 4 times [2022-12-06 05:31:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674550426] [2022-12-06 05:31:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:00,800 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:31:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:00,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674550426] [2022-12-06 05:31:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674550426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:31:00,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:31:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:31:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510727408] [2022-12-06 05:31:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:00,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:31:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:31:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:31:00,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:31:00,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 86 transitions, 530 flow. Second operand has 4 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:31:00,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:00,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:31:00,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:01,477 INFO L130 PetriNetUnfolder]: 6739/9560 cut-off events. [2022-12-06 05:31:01,477 INFO L131 PetriNetUnfolder]: For 22849/22849 co-relation queries the response was YES. [2022-12-06 05:31:01,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35736 conditions, 9560 events. 6739/9560 cut-off events. For 22849/22849 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47664 event pairs, 1103 based on Foata normal form. 7/9566 useless extension candidates. Maximal degree in co-relation 35703. Up to 6229 conditions per place. [2022-12-06 05:31:01,548 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 91 selfloop transitions, 4 changer transitions 100/195 dead transitions. [2022-12-06 05:31:01,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 195 transitions, 1642 flow [2022-12-06 05:31:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:31:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:31:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 05:31:01,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2022-12-06 05:31:01,549 INFO L175 Difference]: Start difference. First operand has 62 places, 86 transitions, 530 flow. Second operand 5 states and 66 transitions. [2022-12-06 05:31:01,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 195 transitions, 1642 flow [2022-12-06 05:31:01,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 195 transitions, 1505 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-06 05:31:01,638 INFO L231 Difference]: Finished difference. Result has 64 places, 78 transitions, 433 flow [2022-12-06 05:31:01,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=64, PETRI_TRANSITIONS=78} [2022-12-06 05:31:01,640 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-12-06 05:31:01,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:01,640 INFO L89 Accepts]: Start accepts. Operand has 64 places, 78 transitions, 433 flow [2022-12-06 05:31:01,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:01,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:01,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 78 transitions, 433 flow [2022-12-06 05:31:01,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 78 transitions, 433 flow [2022-12-06 05:31:01,674 INFO L130 PetriNetUnfolder]: 282/587 cut-off events. [2022-12-06 05:31:01,674 INFO L131 PetriNetUnfolder]: For 884/904 co-relation queries the response was YES. [2022-12-06 05:31:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 587 events. 282/587 cut-off events. For 884/904 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2865 event pairs, 11 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 1711. Up to 170 conditions per place. [2022-12-06 05:31:01,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 78 transitions, 433 flow [2022-12-06 05:31:01,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-06 05:31:01,681 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:01,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 05:31:01,683 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 433 flow [2022-12-06 05:31:01,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:31:01,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:01,684 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, 1, 1, 1, 1] [2022-12-06 05:31:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:31:01,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash 496730675, now seen corresponding path program 5 times [2022-12-06 05:31:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754396050] [2022-12-06 05:31:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754396050] [2022-12-06 05:31:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754396050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113791308] [2022-12-06 05:31:02,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 05:31:02,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:02,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:02,184 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:31:02,195 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:31:02,286 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:31:02,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:31:02,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:31:02,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:02,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:31:02,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:02,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:31:02,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:31:02,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 39 [2022-12-06 05:31:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:02,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:31:04,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:31:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2022-12-06 05:31:04,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:31:04,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 84 treesize of output 62 [2022-12-06 05:31:04,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:31:04,957 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 31 treesize of output 27 [2022-12-06 05:31:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:04,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113791308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:31:04,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:31:04,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 23 [2022-12-06 05:31:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356985321] [2022-12-06 05:31:04,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:31:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:31:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:31:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=482, Unknown=5, NotChecked=0, Total=600 [2022-12-06 05:31:04,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:31:04,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 433 flow. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 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:31:04,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:04,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:31:04,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:10,192 INFO L130 PetriNetUnfolder]: 12901/17947 cut-off events. [2022-12-06 05:31:10,192 INFO L131 PetriNetUnfolder]: For 58290/58290 co-relation queries the response was YES. [2022-12-06 05:31:10,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67717 conditions, 17947 events. 12901/17947 cut-off events. For 58290/58290 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 96110 event pairs, 1333 based on Foata normal form. 18/17964 useless extension candidates. Maximal degree in co-relation 67679. Up to 4269 conditions per place. [2022-12-06 05:31:10,271 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 59 changer transitions 475/651 dead transitions. [2022-12-06 05:31:10,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 651 transitions, 4713 flow [2022-12-06 05:31:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 05:31:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 05:31:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 365 transitions. [2022-12-06 05:31:10,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45285359801488834 [2022-12-06 05:31:10,274 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 433 flow. Second operand 26 states and 365 transitions. [2022-12-06 05:31:10,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 651 transitions, 4713 flow [2022-12-06 05:31:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 651 transitions, 4641 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 05:31:10,370 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 981 flow [2022-12-06 05:31:10,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=981, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2022-12-06 05:31:10,370 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2022-12-06 05:31:10,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:10,371 INFO L89 Accepts]: Start accepts. Operand has 105 places, 117 transitions, 981 flow [2022-12-06 05:31:10,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:10,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:10,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 117 transitions, 981 flow [2022-12-06 05:31:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 117 transitions, 981 flow [2022-12-06 05:31:10,434 INFO L130 PetriNetUnfolder]: 402/870 cut-off events. [2022-12-06 05:31:10,434 INFO L131 PetriNetUnfolder]: For 4898/4949 co-relation queries the response was YES. [2022-12-06 05:31:10,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 870 events. 402/870 cut-off events. For 4898/4949 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4775 event pairs, 38 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 3549. Up to 230 conditions per place. [2022-12-06 05:31:10,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 117 transitions, 981 flow [2022-12-06 05:31:10,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 05:31:10,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 05:31:10,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 05:31:10,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [612] L111-4-->L112-3: Formula: (and (= |v_#pthreadsForks_58| |v_ULTIMATE.start_main_#t~pre21#1_31|) (= |v_#memory_int_191| (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t3~0#1.base_29| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t3~0#1.base_29|) |v_ULTIMATE.start_main_~#t3~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre21#1_31|))) (= (+ |v_#pthreadsForks_58| 1) |v_#pthreadsForks_57|)) InVars {#pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, #memory_int=|v_#memory_int_192|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|} OutVars{#pthreadsForks=|v_#pthreadsForks_57|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, #memory_int=|v_#memory_int_191|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_29|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_31|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_25|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-06 05:31:10,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [632] $Ultimate##0-->L84-4: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~A~0.base_124)) (.cse1 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_41| 4) v_~A~0.offset_124 (- 4)))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|) (= (store |v_#memory_int_252| v_~A~0.base_124 (store .cse0 .cse1 (+ .cse2 1))) |v_#memory_int_251|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19| (ite (< .cse2 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_41| 1) (< |v_thread3Thread1of1ForFork0_~i~2#1_41| (+ 1 v_~N~0_91))))) InVars {~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, #memory_int=|v_#memory_int_252|, ~N~0=v_~N~0_91} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_19|, ~A~0.base=v_~A~0.base_124, ~A~0.offset=v_~A~0.offset_124, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, #memory_int=|v_#memory_int_251|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_23|, ~N~0=v_~N~0_91, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_41|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_19|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 05:31:10,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [571] L68-->L74-4: Formula: (and (= v_~b2~0_21 1) (= v_thread2Thread1of1ForFork3_~i~1_23 0)) InVars {} OutVars{~b2~0=v_~b2~0_21, thread2Thread1of1ForFork3_~i~1=v_thread2Thread1of1ForFork3_~i~1_23} AuxVars[] AssignedVars[~b2~0, thread2Thread1of1ForFork3_~i~1] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 05:31:11,008 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:31:11,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 637 [2022-12-06 05:31:11,008 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 114 transitions, 986 flow [2022-12-06 05:31:11,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 24 states have internal predecessors, (80), 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:31:11,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:11,009 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, 1, 1] [2022-12-06 05:31:11,019 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:31:11,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:11,210 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash -551739182, now seen corresponding path program 1 times [2022-12-06 05:31:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:11,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069585149] [2022-12-06 05:31:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:11,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:11,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069585149] [2022-12-06 05:31:11,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069585149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:11,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184738545] [2022-12-06 05:31:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:11,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:11,932 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:31:11,934 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:31:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:12,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:31:12,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:12,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:12,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:31:12,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 05:31:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:12,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-06 05:31:12,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 05:31:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:12,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:31:16,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-12-06 05:31:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:16,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184738545] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:16,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:31:16,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 31 [2022-12-06 05:31:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048354758] [2022-12-06 05:31:16,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:31:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:31:16,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=880, Unknown=12, NotChecked=0, Total=1056 [2022-12-06 05:31:16,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:16,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 114 transitions, 986 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:31:16,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:16,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:16,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:18,050 INFO L130 PetriNetUnfolder]: 9061/12587 cut-off events. [2022-12-06 05:31:18,050 INFO L131 PetriNetUnfolder]: For 139638/139638 co-relation queries the response was YES. [2022-12-06 05:31:18,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64383 conditions, 12587 events. 9061/12587 cut-off events. For 139638/139638 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 63024 event pairs, 2411 based on Foata normal form. 7/12593 useless extension candidates. Maximal degree in co-relation 64289. Up to 6007 conditions per place. [2022-12-06 05:31:18,124 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 123 selfloop transitions, 19 changer transitions 230/372 dead transitions. [2022-12-06 05:31:18,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 372 transitions, 3896 flow [2022-12-06 05:31:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:31:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:31:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 05:31:18,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.346031746031746 [2022-12-06 05:31:18,125 INFO L175 Difference]: Start difference. First operand has 87 places, 114 transitions, 986 flow. Second operand 9 states and 109 transitions. [2022-12-06 05:31:18,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 372 transitions, 3896 flow [2022-12-06 05:31:18,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 372 transitions, 3613 flow, removed 135 selfloop flow, removed 18 redundant places. [2022-12-06 05:31:18,558 INFO L231 Difference]: Finished difference. Result has 83 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1088, PETRI_PLACES=83, PETRI_TRANSITIONS=122} [2022-12-06 05:31:18,559 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2022-12-06 05:31:18,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:18,559 INFO L89 Accepts]: Start accepts. Operand has 83 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:18,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:18,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,708 INFO L130 PetriNetUnfolder]: 359/809 cut-off events. [2022-12-06 05:31:18,708 INFO L131 PetriNetUnfolder]: For 3095/3150 co-relation queries the response was YES. [2022-12-06 05:31:18,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 809 events. 359/809 cut-off events. For 3095/3150 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4369 event pairs, 9 based on Foata normal form. 10/798 useless extension candidates. Maximal degree in co-relation 3313. Up to 208 conditions per place. [2022-12-06 05:31:18,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-06 05:31:18,719 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:18,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 05:31:18,720 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 122 transitions, 1088 flow [2022-12-06 05:31:18,720 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:31:18,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:18,720 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, 1, 1] [2022-12-06 05:31:18,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:31:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:18,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -744074074, now seen corresponding path program 1 times [2022-12-06 05:31:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279053192] [2022-12-06 05:31:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:31:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:19,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279053192] [2022-12-06 05:31:19,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279053192] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:19,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478152593] [2022-12-06 05:31:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:19,648 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:31:19,650 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:31:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:19,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 05:31:19,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:19,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:19,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:31:19,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:19,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:31:19,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-06 05:31:19,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 05:31:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:19,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:31:22,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 63 [2022-12-06 05:31:22,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-06 05:31:22,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-06 05:31:22,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 140 [2022-12-06 05:31:22,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-12-06 05:31:22,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2022-12-06 05:31:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:31:22,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478152593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:31:22,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:31:22,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-12-06 05:31:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175385061] [2022-12-06 05:31:22,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:31:22,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 05:31:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 05:31:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=780, Unknown=3, NotChecked=0, Total=930 [2022-12-06 05:31:22,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:22,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 122 transitions, 1088 flow. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 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:31:22,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:22,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:22,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:32,206 INFO L130 PetriNetUnfolder]: 18993/26561 cut-off events. [2022-12-06 05:31:32,207 INFO L131 PetriNetUnfolder]: For 170870/170870 co-relation queries the response was YES. [2022-12-06 05:31:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126068 conditions, 26561 events. 18993/26561 cut-off events. For 170870/170870 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 150009 event pairs, 758 based on Foata normal form. 33/26571 useless extension candidates. Maximal degree in co-relation 126001. Up to 6500 conditions per place. [2022-12-06 05:31:32,361 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 232 selfloop transitions, 115 changer transitions 1064/1411 dead transitions. [2022-12-06 05:31:32,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1411 transitions, 12555 flow [2022-12-06 05:31:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-06 05:31:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-06 05:31:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1002 transitions. [2022-12-06 05:31:32,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32532467532467535 [2022-12-06 05:31:32,366 INFO L175 Difference]: Start difference. First operand has 80 places, 122 transitions, 1088 flow. Second operand 88 states and 1002 transitions. [2022-12-06 05:31:32,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1411 transitions, 12555 flow [2022-12-06 05:31:33,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1411 transitions, 11670 flow, removed 433 selfloop flow, removed 7 redundant places. [2022-12-06 05:31:33,435 INFO L231 Difference]: Finished difference. Result has 238 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=2383, PETRI_PLACES=238, PETRI_TRANSITIONS=172} [2022-12-06 05:31:33,435 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 198 predicate places. [2022-12-06 05:31:33,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:33,436 INFO L89 Accepts]: Start accepts. Operand has 238 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:33,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:33,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,549 INFO L130 PetriNetUnfolder]: 448/1053 cut-off events. [2022-12-06 05:31:33,550 INFO L131 PetriNetUnfolder]: For 35217/35332 co-relation queries the response was YES. [2022-12-06 05:31:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7843 conditions, 1053 events. 448/1053 cut-off events. For 35217/35332 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5974 event pairs, 44 based on Foata normal form. 10/1037 useless extension candidates. Maximal degree in co-relation 7567. Up to 268 conditions per place. [2022-12-06 05:31:33,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-06 05:31:33,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:33,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:31:33,605 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 172 transitions, 2383 flow [2022-12-06 05:31:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 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:31:33,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:33,606 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2022-12-06 05:31:33,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:31:33,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 05:31:33,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:33,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:33,811 INFO L85 PathProgramCache]: Analyzing trace with hash 350538384, now seen corresponding path program 1 times [2022-12-06 05:31:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:33,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29509915] [2022-12-06 05:31:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29509915] [2022-12-06 05:31:33,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29509915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:31:33,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:31:33,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:31:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970952726] [2022-12-06 05:31:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:31:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:31:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:31:33,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:33,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 172 transitions, 2383 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:31:33,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:33,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:33,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:35,447 INFO L130 PetriNetUnfolder]: 6655/9549 cut-off events. [2022-12-06 05:31:35,447 INFO L131 PetriNetUnfolder]: For 512207/512207 co-relation queries the response was YES. [2022-12-06 05:31:35,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76103 conditions, 9549 events. 6655/9549 cut-off events. For 512207/512207 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 49315 event pairs, 848 based on Foata normal form. 11/9537 useless extension candidates. Maximal degree in co-relation 75762. Up to 3510 conditions per place. [2022-12-06 05:31:35,561 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 275 selfloop transitions, 59 changer transitions 33/367 dead transitions. [2022-12-06 05:31:35,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 367 transitions, 6246 flow [2022-12-06 05:31:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:31:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:31:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-06 05:31:35,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2022-12-06 05:31:35,570 INFO L175 Difference]: Start difference. First operand has 174 places, 172 transitions, 2383 flow. Second operand 7 states and 116 transitions. [2022-12-06 05:31:35,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 367 transitions, 6246 flow [2022-12-06 05:31:35,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 367 transitions, 4771 flow, removed 732 selfloop flow, removed 55 redundant places. [2022-12-06 05:31:35,964 INFO L231 Difference]: Finished difference. Result has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:35,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2325, PETRI_PLACES=129, PETRI_TRANSITIONS=194} [2022-12-06 05:31:35,964 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2022-12-06 05:31:35,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:35,964 INFO L89 Accepts]: Start accepts. Operand has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:35,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:35,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:35,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:35,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:36,104 INFO L130 PetriNetUnfolder]: 695/1569 cut-off events. [2022-12-06 05:31:36,104 INFO L131 PetriNetUnfolder]: For 17604/17955 co-relation queries the response was YES. [2022-12-06 05:31:36,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9047 conditions, 1569 events. 695/1569 cut-off events. For 17604/17955 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9891 event pairs, 54 based on Foata normal form. 38/1583 useless extension candidates. Maximal degree in co-relation 8680. Up to 435 conditions per place. [2022-12-06 05:31:36,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:36,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 05:31:36,134 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:36,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:31:36,136 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 194 transitions, 2325 flow [2022-12-06 05:31:36,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:31:36,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:36,136 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2022-12-06 05:31:36,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:31:36,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -388125292, now seen corresponding path program 2 times [2022-12-06 05:31:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179368520] [2022-12-06 05:31:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:36,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179368520] [2022-12-06 05:31:36,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179368520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:31:36,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:31:36,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:31:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749785891] [2022-12-06 05:31:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:31:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:31:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:31:36,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:36,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 194 transitions, 2325 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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:31:36,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:36,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:37,522 INFO L130 PetriNetUnfolder]: 6966/10216 cut-off events. [2022-12-06 05:31:37,522 INFO L131 PetriNetUnfolder]: For 158759/158759 co-relation queries the response was YES. [2022-12-06 05:31:37,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64094 conditions, 10216 events. 6966/10216 cut-off events. For 158759/158759 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 54221 event pairs, 1648 based on Foata normal form. 135/10349 useless extension candidates. Maximal degree in co-relation 61559. Up to 4837 conditions per place. [2022-12-06 05:31:37,615 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 221 selfloop transitions, 5 changer transitions 66/292 dead transitions. [2022-12-06 05:31:37,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 292 transitions, 3964 flow [2022-12-06 05:31:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:31:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:31:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 05:31:37,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:31:37,616 INFO L175 Difference]: Start difference. First operand has 129 places, 194 transitions, 2325 flow. Second operand 6 states and 80 transitions. [2022-12-06 05:31:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 292 transitions, 3964 flow [2022-12-06 05:31:37,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 292 transitions, 3898 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-06 05:31:37,829 INFO L231 Difference]: Finished difference. Result has 134 places, 195 transitions, 2375 flow [2022-12-06 05:31:37,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2375, PETRI_PLACES=134, PETRI_TRANSITIONS=195} [2022-12-06 05:31:37,830 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2022-12-06 05:31:37,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:37,830 INFO L89 Accepts]: Start accepts. Operand has 134 places, 195 transitions, 2375 flow [2022-12-06 05:31:37,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:37,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:37,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 195 transitions, 2375 flow [2022-12-06 05:31:37,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 195 transitions, 2375 flow [2022-12-06 05:31:37,950 INFO L130 PetriNetUnfolder]: 647/1448 cut-off events. [2022-12-06 05:31:37,950 INFO L131 PetriNetUnfolder]: For 15302/15593 co-relation queries the response was YES. [2022-12-06 05:31:37,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8413 conditions, 1448 events. 647/1448 cut-off events. For 15302/15593 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8942 event pairs, 53 based on Foata normal form. 35/1457 useless extension candidates. Maximal degree in co-relation 8351. Up to 386 conditions per place. [2022-12-06 05:31:37,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 195 transitions, 2375 flow [2022-12-06 05:31:37,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 1648 [2022-12-06 05:31:40,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:31:40,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2371 [2022-12-06 05:31:40,201 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 194 transitions, 2371 flow [2022-12-06 05:31:40,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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:31:40,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:40,201 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2022-12-06 05:31:40,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:31:40,201 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1098667857, now seen corresponding path program 1 times [2022-12-06 05:31:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:40,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827458311] [2022-12-06 05:31:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:31:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827458311] [2022-12-06 05:31:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827458311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:31:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:31:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:31:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587718766] [2022-12-06 05:31:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:31:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:31:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:31:40,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:40,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 194 transitions, 2371 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:31:40,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:40,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:40,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:41,302 INFO L130 PetriNetUnfolder]: 6028/8671 cut-off events. [2022-12-06 05:31:41,303 INFO L131 PetriNetUnfolder]: For 128358/128358 co-relation queries the response was YES. [2022-12-06 05:31:41,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55400 conditions, 8671 events. 6028/8671 cut-off events. For 128358/128358 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 42897 event pairs, 2382 based on Foata normal form. 212/8882 useless extension candidates. Maximal degree in co-relation 55336. Up to 6866 conditions per place. [2022-12-06 05:31:41,357 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 176 selfloop transitions, 55 changer transitions 0/231 dead transitions. [2022-12-06 05:31:41,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 231 transitions, 3303 flow [2022-12-06 05:31:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:31:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:31:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 05:31:41,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-06 05:31:41,358 INFO L175 Difference]: Start difference. First operand has 131 places, 194 transitions, 2371 flow. Second operand 4 states and 52 transitions. [2022-12-06 05:31:41,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 231 transitions, 3303 flow [2022-12-06 05:31:41,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 231 transitions, 3181 flow, removed 60 selfloop flow, removed 5 redundant places. [2022-12-06 05:31:41,532 INFO L231 Difference]: Finished difference. Result has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2365, PETRI_PLACES=127, PETRI_TRANSITIONS=191} [2022-12-06 05:31:41,533 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2022-12-06 05:31:41,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:41,533 INFO L89 Accepts]: Start accepts. Operand has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:41,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:41,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,656 INFO L130 PetriNetUnfolder]: 625/1382 cut-off events. [2022-12-06 05:31:41,656 INFO L131 PetriNetUnfolder]: For 15811/16051 co-relation queries the response was YES. [2022-12-06 05:31:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8331 conditions, 1382 events. 625/1382 cut-off events. For 15811/16051 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8366 event pairs, 52 based on Foata normal form. 28/1382 useless extension candidates. Maximal degree in co-relation 8002. Up to 348 conditions per place. [2022-12-06 05:31:41,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 1508 [2022-12-06 05:31:41,708 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:41,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:31:41,708 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 191 transitions, 2365 flow [2022-12-06 05:31:41,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:31:41,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:41,709 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2022-12-06 05:31:41,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:31:41,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 233517695, now seen corresponding path program 1 times [2022-12-06 05:31:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:41,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748868089] [2022-12-06 05:31:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748868089] [2022-12-06 05:31:41,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748868089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153360075] [2022-12-06 05:31:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:41,797 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:31:41,836 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:31:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:41,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:31:41,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:41,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:31:41,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153360075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:31:41,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:31:41,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 05:31:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069734044] [2022-12-06 05:31:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:31:41,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:31:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:41,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:31:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:31:41,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:41,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 191 transitions, 2365 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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:31:41,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:41,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:43,145 INFO L130 PetriNetUnfolder]: 6766/9968 cut-off events. [2022-12-06 05:31:43,145 INFO L131 PetriNetUnfolder]: For 141305/141305 co-relation queries the response was YES. [2022-12-06 05:31:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63352 conditions, 9968 events. 6766/9968 cut-off events. For 141305/141305 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 52262 event pairs, 3306 based on Foata normal form. 125/10091 useless extension candidates. Maximal degree in co-relation 61016. Up to 8672 conditions per place. [2022-12-06 05:31:43,218 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 190 selfloop transitions, 2 changer transitions 98/290 dead transitions. [2022-12-06 05:31:43,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 290 transitions, 4079 flow [2022-12-06 05:31:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:31:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:31:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 05:31:43,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 05:31:43,219 INFO L175 Difference]: Start difference. First operand has 127 places, 191 transitions, 2365 flow. Second operand 6 states and 75 transitions. [2022-12-06 05:31:43,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 290 transitions, 4079 flow [2022-12-06 05:31:43,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 290 transitions, 3917 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 05:31:43,423 INFO L231 Difference]: Finished difference. Result has 133 places, 192 transitions, 2373 flow [2022-12-06 05:31:43,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2373, PETRI_PLACES=133, PETRI_TRANSITIONS=192} [2022-12-06 05:31:43,424 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2022-12-06 05:31:43,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:43,424 INFO L89 Accepts]: Start accepts. Operand has 133 places, 192 transitions, 2373 flow [2022-12-06 05:31:43,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:43,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:43,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 192 transitions, 2373 flow [2022-12-06 05:31:43,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 192 transitions, 2373 flow [2022-12-06 05:31:43,544 INFO L130 PetriNetUnfolder]: 623/1383 cut-off events. [2022-12-06 05:31:43,544 INFO L131 PetriNetUnfolder]: For 15170/15415 co-relation queries the response was YES. [2022-12-06 05:31:43,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8204 conditions, 1383 events. 623/1383 cut-off events. For 15170/15415 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8359 event pairs, 52 based on Foata normal form. 29/1386 useless extension candidates. Maximal degree in co-relation 8146. Up to 345 conditions per place. [2022-12-06 05:31:43,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 192 transitions, 2373 flow [2022-12-06 05:31:43,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 1508 [2022-12-06 05:31:45,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:31:45,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2168 [2022-12-06 05:31:45,592 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 191 transitions, 2369 flow [2022-12-06 05:31:45,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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:31:45,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:45,593 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1] [2022-12-06 05:31:45,599 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:31:45,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:31:45,793 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1182630804, now seen corresponding path program 1 times [2022-12-06 05:31:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:45,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165160052] [2022-12-06 05:31:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:31:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165160052] [2022-12-06 05:31:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165160052] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126075210] [2022-12-06 05:31:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:45,880 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:31:45,882 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:31:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:31:45,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:46,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:31:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:31:46,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126075210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:31:46,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:31:46,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-06 05:31:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764043433] [2022-12-06 05:31:46,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:31:46,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:31:46,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:31:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:31:46,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:46,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 191 transitions, 2369 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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:31:46,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:46,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:46,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:48,183 INFO L130 PetriNetUnfolder]: 10117/14383 cut-off events. [2022-12-06 05:31:48,183 INFO L131 PetriNetUnfolder]: For 203342/203342 co-relation queries the response was YES. [2022-12-06 05:31:48,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96087 conditions, 14383 events. 10117/14383 cut-off events. For 203342/203342 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 77432 event pairs, 2200 based on Foata normal form. 1496/15878 useless extension candidates. Maximal degree in co-relation 96029. Up to 6958 conditions per place. [2022-12-06 05:31:48,325 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 330 selfloop transitions, 73 changer transitions 0/403 dead transitions. [2022-12-06 05:31:48,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 403 transitions, 5727 flow [2022-12-06 05:31:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:31:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:31:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-06 05:31:48,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-06 05:31:48,327 INFO L175 Difference]: Start difference. First operand has 129 places, 191 transitions, 2369 flow. Second operand 7 states and 97 transitions. [2022-12-06 05:31:48,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 403 transitions, 5727 flow [2022-12-06 05:31:48,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 403 transitions, 5515 flow, removed 106 selfloop flow, removed 5 redundant places. [2022-12-06 05:31:48,509 INFO L231 Difference]: Finished difference. Result has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2716, PETRI_PLACES=133, PETRI_TRANSITIONS=206} [2022-12-06 05:31:48,510 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2022-12-06 05:31:48,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:48,511 INFO L89 Accepts]: Start accepts. Operand has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:48,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:48,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,781 INFO L130 PetriNetUnfolder]: 1032/2254 cut-off events. [2022-12-06 05:31:48,782 INFO L131 PetriNetUnfolder]: For 31458/31877 co-relation queries the response was YES. [2022-12-06 05:31:48,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16001 conditions, 2254 events. 1032/2254 cut-off events. For 31458/31877 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15391 event pairs, 157 based on Foata normal form. 77/2271 useless extension candidates. Maximal degree in co-relation 15164. Up to 705 conditions per place. [2022-12-06 05:31:48,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-06 05:31:48,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:31:48,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-06 05:31:48,875 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 206 transitions, 2716 flow [2022-12-06 05:31:48,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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:31:48,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:48,875 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1] [2022-12-06 05:31:48,882 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:31:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:49,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1316109578, now seen corresponding path program 1 times [2022-12-06 05:31:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433376910] [2022-12-06 05:31:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:31:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433376910] [2022-12-06 05:31:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433376910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992827081] [2022-12-06 05:31:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:49,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:49,195 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:31:49,236 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:31:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:49,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:31:49,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:31:49,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:31:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:31:49,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992827081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:31:49,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:31:49,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:31:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501945324] [2022-12-06 05:31:49,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:31:49,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:31:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:31:49,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:31:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:31:49,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:31:49,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 206 transitions, 2716 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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:31:49,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:31:49,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:31:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:51,786 INFO L130 PetriNetUnfolder]: 11493/16183 cut-off events. [2022-12-06 05:31:51,786 INFO L131 PetriNetUnfolder]: For 281109/281109 co-relation queries the response was YES. [2022-12-06 05:31:51,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115816 conditions, 16183 events. 11493/16183 cut-off events. For 281109/281109 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 83413 event pairs, 3476 based on Foata normal form. 1188/17370 useless extension candidates. Maximal degree in co-relation 106726. Up to 9397 conditions per place. [2022-12-06 05:31:51,985 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 301 selfloop transitions, 23 changer transitions 4/328 dead transitions. [2022-12-06 05:31:51,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 328 transitions, 5223 flow [2022-12-06 05:31:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:31:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:31:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 05:31:51,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.319047619047619 [2022-12-06 05:31:51,986 INFO L175 Difference]: Start difference. First operand has 133 places, 206 transitions, 2716 flow. Second operand 6 states and 67 transitions. [2022-12-06 05:31:51,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 328 transitions, 5223 flow [2022-12-06 05:31:52,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 328 transitions, 5047 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-12-06 05:31:52,212 INFO L231 Difference]: Finished difference. Result has 138 places, 212 transitions, 2763 flow [2022-12-06 05:31:52,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2632, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2763, PETRI_PLACES=138, PETRI_TRANSITIONS=212} [2022-12-06 05:31:52,212 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2022-12-06 05:31:52,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:31:52,212 INFO L89 Accepts]: Start accepts. Operand has 138 places, 212 transitions, 2763 flow [2022-12-06 05:31:52,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:31:52,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:31:52,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 212 transitions, 2763 flow [2022-12-06 05:31:52,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 212 transitions, 2763 flow [2022-12-06 05:31:52,464 INFO L130 PetriNetUnfolder]: 1229/2619 cut-off events. [2022-12-06 05:31:52,465 INFO L131 PetriNetUnfolder]: For 36289/36608 co-relation queries the response was YES. [2022-12-06 05:31:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 2619 events. 1229/2619 cut-off events. For 36289/36608 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17940 event pairs, 213 based on Foata normal form. 82/2641 useless extension candidates. Maximal degree in co-relation 16848. Up to 599 conditions per place. [2022-12-06 05:31:52,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 212 transitions, 2763 flow [2022-12-06 05:31:52,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 1838 [2022-12-06 05:31:52,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L56-4-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_35 (+ v_thread1Thread1of1ForFork1_~i~0_36 1)) (< v_thread1Thread1of1ForFork1_~i~0_36 v_~N~0_77) (let ((.cse1 (select (select |v_#memory_int_213| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_36 4))))) (let ((.cse0 (< v_~min~0_74 .cse1))) (or (and (not .cse0) (= v_~min~0_73 |v_thread1_#t~mem4_35|) (= .cse1 |v_thread1_#t~mem4_35|)) (and (= |v_thread1_#t~mem4_35| |v_thread1Thread1of1ForFork1_#t~mem4_22|) (= v_~min~0_74 v_~min~0_73) .cse0))))) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem4=|v_thread1Thread1of1ForFork1_#t~mem4_22|, ~min~0=v_~min~0_74, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~N~0=v_~N~0_77} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_13|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_17|, ~min~0=v_~min~0_73, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_35, ~N~0=v_~N~0_77, thread1Thread1of1ForFork1_#t~ite5=|v_thread1Thread1of1ForFork1_#t~ite5_13|} AuxVars[|v_thread1_#t~mem4_35|] AssignedVars[thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~mem4, thread1Thread1of1ForFork1_#t~post2, ~min~0, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~ite5] and [532] L84-4-->L84-4: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~A~0.base_66)) (.cse2 (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_34| 4) v_~A~0.offset_66))) (let ((.cse0 (select .cse1 .cse2))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| (ite (< .cse0 2147483647) 1 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_33| (+ |v_thread3Thread1of1ForFork0_~i~2#1_34| 1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_34| v_~N~0_29) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|) (= (store |v_#memory_int_126| v_~A~0.base_66 (store .cse1 .cse2 (+ .cse0 1))) |v_#memory_int_125|)))) InVars {~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_34|} OutVars{thread3Thread1of1ForFork0_#t~post14#1=|v_thread3Thread1of1ForFork0_#t~post14#1_17|, ~A~0.base=v_~A~0.base_66, ~A~0.offset=v_~A~0.offset_66, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, #memory_int=|v_#memory_int_125|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_19|, ~N~0=v_~N~0_29, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_33|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_17|, thread3Thread1of1ForFork0_#t~mem13#1=|v_thread3Thread1of1ForFork0_#t~mem13#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post14#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_#t~mem13#1] [2022-12-06 05:31:52,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:31:52,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-06 05:31:52,715 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 212 transitions, 2771 flow [2022-12-06 05:31:52,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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:31:52,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:31:52,716 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 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:31:52,729 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:31:52,920 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,SelfDestructingSolverStorable16 [2022-12-06 05:31:52,921 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:31:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:31:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1518170262, now seen corresponding path program 1 times [2022-12-06 05:31:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:31:52,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469320960] [2022-12-06 05:31:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:31:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-06 05:31:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:31:53,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469320960] [2022-12-06 05:31:53,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469320960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:31:53,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188193775] [2022-12-06 05:31:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:31:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:31:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:31:53,628 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:31:53,630 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:31:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:31:53,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:31:53,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:31:53,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:53,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 05:31:53,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:53,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-06 05:31:54,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:31:54,116 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-12-06 05:31:54,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 66 [2022-12-06 05:31:54,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:54,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-06 05:31:54,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:31:54,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-06 05:31:54,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-06 05:31:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-06 05:31:54,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:32:11,528 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 151 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:32:11,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6245 treesize of output 5981 [2022-12-06 05:32:13,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:13,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 6082 treesize of output 6579 [2022-12-06 05:32:15,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:15,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 5611 treesize of output 6089 [2022-12-06 05:32:16,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:16,107 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 5050 treesize of output 4933 [2022-12-06 05:32:16,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:16,666 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 4938 treesize of output 4893 [2022-12-06 05:32:17,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:17,217 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 4898 treesize of output 4845 [2022-12-06 05:32:17,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:17,771 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 4866 treesize of output 4749 [2022-12-06 05:32:18,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:18,322 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 4746 treesize of output 4729 [2022-12-06 05:32:18,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:18,877 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 4726 treesize of output 4709 [2022-12-06 05:32:19,334 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 05:32:19,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:19,418 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 4730 treesize of output 4637 [2022-12-06 05:32:19,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:32:19,967 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 4634 treesize of output 4613 Received shutdown request... [2022-12-06 05:44:12,252 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:44:12,252 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:44:12,273 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:44:12,275 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 05:44:12,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 05:44:12,480 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,SelfDestructingSolverStorable17 [2022-12-06 05:44:12,481 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. [2022-12-06 05:44:12,483 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 05:44:12,483 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 05:44:12,483 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 05:44:12,483 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 05:44:12,483 INFO L458 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:12,486 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:44:12,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:44:12,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:44:12 BasicIcfg [2022-12-06 05:44:12,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:44:12,488 INFO L158 Benchmark]: Toolchain (without parser) took 861592.68ms. Allocated memory was 194.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 169.8MB in the beginning and 941.0MB in the end (delta: -771.1MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 156.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 194.0MB. Free memory was 156.1MB in the beginning and 154.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 194.0MB. Free memory was 154.1MB in the beginning and 152.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: RCFGBuilder took 609.56ms. Allocated memory is still 194.0MB. Free memory was 152.4MB in the beginning and 158.4MB in the end (delta: -6.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:44:12,488 INFO L158 Benchmark]: TraceAbstraction took 860584.69ms. Allocated memory was 194.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 157.8MB in the beginning and 941.0MB in the end (delta: -783.1MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 05:44:12,489 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.09ms. Allocated memory is still 127.9MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 156.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 194.0MB. Free memory was 156.1MB in the beginning and 154.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 194.0MB. Free memory was 154.1MB in the beginning and 152.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 609.56ms. Allocated memory is still 194.0MB. Free memory was 152.4MB in the beginning and 158.4MB in the end (delta: -6.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 860584.69ms. Allocated memory was 194.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 157.8MB in the beginning and 941.0MB in the end (delta: -783.1MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 145 PlacesBefore, 40 PlacesAfterwards, 144 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 39 ConcurrentYvCompositions, 8 ChoiceCompositions, 113 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 1309, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1331, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2012, Positive conditional cache size: 0, Positive unconditional cache size: 2012, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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, 36 PlacesBefore, 36 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 43, independent unconditional: 12, dependent: 8, dependent conditional: 5, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 55, independent conditional: 14, independent unconditional: 41, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 14, independent unconditional: 41, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 10, independent unconditional: 30, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 15, independent conditional: 4, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 47, unknown conditional: 12, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 40, Positive conditional cache size: 10, Positive unconditional cache size: 30, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 93, independent conditional: 93, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 93, independent conditional: 29, independent unconditional: 64, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 93, independent conditional: 14, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 93, independent conditional: 14, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 6, independent unconditional: 16, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 71, independent conditional: 8, independent unconditional: 63, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 26, unknown conditional: 10, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 65, Positive conditional cache size: 16, Positive unconditional cache size: 49, Negative cache size: 11, Negative conditional cache size: 6, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 47, independent unconditional: 26, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 73, independent conditional: 27, independent unconditional: 46, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 27, independent unconditional: 46, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 57, independent conditional: 18, independent unconditional: 39, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 19, unknown conditional: 11, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 81, Positive conditional cache size: 25, Positive unconditional cache size: 56, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 39 PlacesBefore, 38 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 116, independent conditional: 16, independent unconditional: 100, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 132, independent: 110, independent conditional: 15, independent unconditional: 95, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 83 PlacesBefore, 83 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1518 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 67 PlacesBefore, 67 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 858 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 62 PlacesBefore, 62 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 872 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 61 PlacesBefore, 61 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 742 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): 101, Positive cache size: 87, Positive conditional cache size: 26, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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.6s, 88 PlacesBefore, 87 PlacesAfterwards, 117 TransitionsBefore, 114 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 55, 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: 55, independent: 55, independent conditional: 37, independent unconditional: 18, 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: 55, independent: 55, independent conditional: 37, independent unconditional: 18, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 45, independent conditional: 27, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 117, Positive conditional cache size: 36, Positive unconditional cache size: 81, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 1054 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): 131, Positive cache size: 117, Positive conditional cache size: 36, Positive unconditional cache size: 81, Negative cache size: 14, Negative conditional cache size: 8, Negative unconditional cache size: 6, 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, 174 PlacesBefore, 174 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 133, Positive conditional cache size: 52, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 134, Positive conditional cache size: 53, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 132 PlacesBefore, 131 PlacesAfterwards, 195 TransitionsBefore, 194 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, 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: 36, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 134, Positive conditional cache size: 53, Positive unconditional cache size: 81, Negative cache size: 25, Negative conditional cache size: 19, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 191 TransitionsBefore, 191 TransitionsAfterwards, 1508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 30, Negative conditional cache size: 24, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 130 PlacesBefore, 129 PlacesAfterwards, 192 TransitionsBefore, 191 TransitionsAfterwards, 1508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, 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: 40, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 30, Negative conditional cache size: 24, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 133 PlacesBefore, 133 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 136, Positive conditional cache size: 55, Positive unconditional cache size: 81, Negative cache size: 34, Negative conditional cache size: 28, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 138 PlacesBefore, 138 PlacesAfterwards, 212 TransitionsBefore, 212 TransitionsAfterwards, 1838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 149, Positive conditional cache size: 66, Positive unconditional cache size: 83, Negative cache size: 36, Negative conditional cache size: 30, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. - TimeoutResultAtElement [Line: 110]: 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 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. - TimeoutResultAtElement [Line: 112]: 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 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. - TimeoutResultAtElement [Line: 111]: 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 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. - TimeoutResultAtElement [Line: 113]: 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 34 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 67ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 5 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: 860.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 87.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4857 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4857 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 969 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6904 IncrementalHoareTripleChecker+Invalid, 8438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 565 mSolverCounterUnsat, 1 mSDtfsCounter, 6904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 336 SyntacticMatches, 20 SemanticMatches, 352 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6927 ImplicationChecksByTransitivity, 70.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2771occurred in iteration=17, InterpolantAutomatonStates: 233, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 886 ConstructedInterpolants, 33 QuantifiedInterpolants, 6832 SizeOfPredicates, 96 NumberOfNonLiveVariables, 2374 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 68/93 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