/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:26:58,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:26:58,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:26:58,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:26:58,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:26:58,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:26:58,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:26:58,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:26:58,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:26:58,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:26:58,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:26:58,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:26:58,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:26:58,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:26:58,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:26:58,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:26:58,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:26:58,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:26:58,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:26:58,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:26:58,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:26:58,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:26:58,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:26:58,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:26:58,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:26:58,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:26:58,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:26:58,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:26:58,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:26:58,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:26:58,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:26:58,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:26:58,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:26:58,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:26:58,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:26:58,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:26:58,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:26:58,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:26:58,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:26:58,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:26:58,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:26:58,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:26:58,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:26:58,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:26:58,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:26:58,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:26:58,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:26:58,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:26:58,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:26:58,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:26:58,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:26:58,197 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:26:58,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:26:58,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:26:58,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:26:58,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:26:58,480 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:26:58,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 02:26:59,464 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:26:59,672 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:26:59,673 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 02:26:59,685 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bdf22cd/b441510941564af79884b6f6b370df68/FLAGce557487c [2022-12-06 02:26:59,696 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bdf22cd/b441510941564af79884b6f6b370df68 [2022-12-06 02:26:59,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:26:59,701 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:26:59,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:26:59,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:26:59,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:26:59,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:26:59" (1/1) ... [2022-12-06 02:26:59,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492c9f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:26:59, skipping insertion in model container [2022-12-06 02:26:59,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:26:59" (1/1) ... [2022-12-06 02:26:59,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:26:59,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:26:59,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,930 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-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 02:26:59,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:26:59,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:26:59,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:26:59,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:26:59,985 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-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 02:26:59,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:27:00,004 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:27:00,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00 WrapperNode [2022-12-06 02:27:00,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:27:00,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:00,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:27:00,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:27:00,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,064 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-12-06 02:27:00,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:00,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:27:00,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:27:00,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:27:00,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,110 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:27:00,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:27:00,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:27:00,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:27:00,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (1/1) ... [2022-12-06 02:27:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:27:00,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:00,163 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 02:27:00,169 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 02:27:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:27:00,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:27:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:27:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:27:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:27:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:27:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:27:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:27:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:27:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:27:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:27:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:27:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:27:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:27:00,198 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 02:27:00,281 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:27:00,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:27:00,735 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:27:00,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:27:00,930 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 02:27:00,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:27:00 BoogieIcfgContainer [2022-12-06 02:27:00,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:27:00,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:27:00,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:27:00,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:27:00,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:26:59" (1/3) ... [2022-12-06 02:27:00,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3ea10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:27:00, skipping insertion in model container [2022-12-06 02:27:00,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:00" (2/3) ... [2022-12-06 02:27:00,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3ea10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:27:00, skipping insertion in model container [2022-12-06 02:27:00,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:27:00" (3/3) ... [2022-12-06 02:27:00,940 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-12-06 02:27:00,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:27:00,953 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:27:00,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:27:01,033 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 02:27:01,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 02:27:01,201 INFO L130 PetriNetUnfolder]: 37/327 cut-off events. [2022-12-06 02:27:01,201 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:27:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 327 events. 37/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 02:27:01,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 02:27:01,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 315 transitions, 654 flow [2022-12-06 02:27:01,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:01,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 02:27:01,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 315 transitions, 654 flow [2022-12-06 02:27:01,293 INFO L130 PetriNetUnfolder]: 37/315 cut-off events. [2022-12-06 02:27:01,293 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:27:01,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 315 events. 37/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 02:27:01,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 02:27:01,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 5184 [2022-12-06 02:27:12,774 INFO L203 LiptonReduction]: Total number of compositions: 274 [2022-12-06 02:27:12,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:27:12,801 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;@455bdee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:27:12,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 02:27:12,807 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 02:27:12,807 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:27:12,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:12,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:12,808 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 02:27:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1058262679, now seen corresponding path program 1 times [2022-12-06 02:27:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:12,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3075257] [2022-12-06 02:27:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:13,390 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 02:27:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:13,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3075257] [2022-12-06 02:27:13,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3075257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:13,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:13,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:27:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982463479] [2022-12-06 02:27:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:13,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:27:13,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:27:13,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 02:27:13,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:13,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:27:13,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:13,624 INFO L130 PetriNetUnfolder]: 501/685 cut-off events. [2022-12-06 02:27:13,624 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 02:27:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 685 events. 501/685 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 02:27:13,631 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 49 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-06 02:27:13,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 265 flow [2022-12-06 02:27:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:27:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:27:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 02:27:13,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-06 02:27:13,644 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-06 02:27:13,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:13,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 55 transitions, 265 flow [2022-12-06 02:27:13,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 55 transitions, 265 flow [2022-12-06 02:27:13,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:13,657 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:13,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 02:27:13,659 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 55 transitions, 265 flow [2022-12-06 02:27:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 02:27:13,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:13,660 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] [2022-12-06 02:27:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:27:13,662 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 02:27:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1410111894, now seen corresponding path program 1 times [2022-12-06 02:27:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:13,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797634833] [2022-12-06 02:27:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:14,374 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 02:27:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:14,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797634833] [2022-12-06 02:27:14,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797634833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:14,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312394683] [2022-12-06 02:27:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:14,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:14,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:14,378 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 02:27:14,379 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 02:27:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:14,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:27:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:14,622 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 02:27:14,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:27:14,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312394683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:14,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:27:14,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2022-12-06 02:27:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813173852] [2022-12-06 02:27:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:14,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:27:14,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:27:14,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 55 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 02:27:14,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:14,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:27:14,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:14,765 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-06 02:27:14,765 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 02:27:14,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 647 events. 467/647 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1708 event pairs, 117 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 1378. Up to 433 conditions per place. [2022-12-06 02:27:14,769 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2022-12-06 02:27:14,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 354 flow [2022-12-06 02:27:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:27:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:27:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 02:27:14,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 02:27:14,772 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 02:27:14,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:14,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 52 transitions, 354 flow [2022-12-06 02:27:14,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 52 transitions, 354 flow [2022-12-06 02:27:14,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:14,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:14,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:27:14,780 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 52 transitions, 354 flow [2022-12-06 02:27:14,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 02:27:14,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:14,780 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] [2022-12-06 02:27:14,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:14,986 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 02:27:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1600157581, now seen corresponding path program 1 times [2022-12-06 02:27:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129840306] [2022-12-06 02:27:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:15,286 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 02:27:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129840306] [2022-12-06 02:27:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129840306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:15,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:27:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350764882] [2022-12-06 02:27:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:15,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:27:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:27:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:27:15,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:27:15,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 52 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 02:27:15,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:15,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:27:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:15,789 INFO L130 PetriNetUnfolder]: 1686/2365 cut-off events. [2022-12-06 02:27:15,790 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-06 02:27:15,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9766 conditions, 2365 events. 1686/2365 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8783 event pairs, 351 based on Foata normal form. 0/1566 useless extension candidates. Maximal degree in co-relation 2356. Up to 1725 conditions per place. [2022-12-06 02:27:15,802 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 166 selfloop transitions, 13 changer transitions 3/182 dead transitions. [2022-12-06 02:27:15,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 182 transitions, 1606 flow [2022-12-06 02:27:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2022-12-06 02:27:15,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 02:27:15,806 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 02:27:15,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:15,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 182 transitions, 1606 flow [2022-12-06 02:27:15,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 182 transitions, 1606 flow [2022-12-06 02:27:15,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:20,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:20,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4889 [2022-12-06 02:27:20,695 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 181 transitions, 1598 flow [2022-12-06 02:27:20,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 02:27:20,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:20,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:20,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:27:20,695 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 02:27:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 889260446, now seen corresponding path program 1 times [2022-12-06 02:27:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:20,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441488447] [2022-12-06 02:27:20,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:20,851 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 02:27:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:20,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441488447] [2022-12-06 02:27:20,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441488447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:20,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:20,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:27:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378741967] [2022-12-06 02:27:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:20,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:27:20,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:27:20,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 181 transitions, 1598 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 02:27:20,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:20,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:27:20,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:21,230 INFO L130 PetriNetUnfolder]: 1704/2460 cut-off events. [2022-12-06 02:27:21,231 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-12-06 02:27:21,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12638 conditions, 2460 events. 1704/2460 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9913 event pairs, 351 based on Foata normal form. 0/1749 useless extension candidates. Maximal degree in co-relation 3666. Up to 1821 conditions per place. [2022-12-06 02:27:21,244 INFO L137 encePairwiseOnDemand]: 32/34 looper letters, 183 selfloop transitions, 1 changer transitions 9/193 dead transitions. [2022-12-06 02:27:21,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 193 transitions, 2095 flow [2022-12-06 02:27:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:27:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:27:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 02:27:21,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 02:27:21,249 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 02:27:21,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:21,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 193 transitions, 2095 flow [2022-12-06 02:27:21,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 193 transitions, 2095 flow [2022-12-06 02:27:21,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:21,261 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:21,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:27:21,263 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 193 transitions, 2095 flow [2022-12-06 02:27:21,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 02:27:21,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:21,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:21,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:27:21,264 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 02:27:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1137922796, now seen corresponding path program 1 times [2022-12-06 02:27:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488213141] [2022-12-06 02:27:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:21,450 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 02:27:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488213141] [2022-12-06 02:27:21,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488213141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:21,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:21,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512315018] [2022-12-06 02:27:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:21,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:27:21,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 193 transitions, 2095 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 02:27:21,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:21,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:27:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:21,733 INFO L130 PetriNetUnfolder]: 1106/1636 cut-off events. [2022-12-06 02:27:21,733 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 02:27:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10070 conditions, 1636 events. 1106/1636 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6142 event pairs, 351 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 5096. Up to 1212 conditions per place. [2022-12-06 02:27:21,742 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 86 selfloop transitions, 3 changer transitions 52/141 dead transitions. [2022-12-06 02:27:21,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 141 transitions, 1815 flow [2022-12-06 02:27:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 02:27:21,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-06 02:27:21,745 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-06 02:27:21,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:21,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 141 transitions, 1815 flow [2022-12-06 02:27:21,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 141 transitions, 1815 flow [2022-12-06 02:27:21,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:28,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:28,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7207 [2022-12-06 02:27:28,952 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 140 transitions, 1803 flow [2022-12-06 02:27:28,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 02:27:28,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:28,952 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] [2022-12-06 02:27:28,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:27:28,953 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 02:27:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1755256616, now seen corresponding path program 1 times [2022-12-06 02:27:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:28,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589322416] [2022-12-06 02:27:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:29,232 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 02:27:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589322416] [2022-12-06 02:27:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589322416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:29,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:29,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:27:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990343854] [2022-12-06 02:27:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:29,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:27:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:27:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:27:29,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:27:29,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 140 transitions, 1803 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 02:27:29,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:29,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:27:29,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:29,558 INFO L130 PetriNetUnfolder]: 1240/1831 cut-off events. [2022-12-06 02:27:29,558 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-06 02:27:29,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 1831 events. 1240/1831 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6799 event pairs, 351 based on Foata normal form. 0/1350 useless extension candidates. Maximal degree in co-relation 7002. Up to 1406 conditions per place. [2022-12-06 02:27:29,569 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 106 selfloop transitions, 6 changer transitions 54/166 dead transitions. [2022-12-06 02:27:29,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 166 transitions, 2456 flow [2022-12-06 02:27:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 02:27:29,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4114285714285714 [2022-12-06 02:27:29,576 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-06 02:27:29,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:29,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 166 transitions, 2456 flow [2022-12-06 02:27:29,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 166 transitions, 2456 flow [2022-12-06 02:27:29,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:29,586 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:29,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:27:29,587 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 166 transitions, 2456 flow [2022-12-06 02:27:29,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 02:27:29,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:29,587 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] [2022-12-06 02:27:29,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:27:29,588 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 02:27:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1955926890, now seen corresponding path program 1 times [2022-12-06 02:27:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:29,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345337295] [2022-12-06 02:27:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:29,882 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 02:27:29,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:29,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345337295] [2022-12-06 02:27:29,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345337295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:29,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708043693] [2022-12-06 02:27:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:29,885 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 02:27:29,886 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 02:27:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:30,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:27:30,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:30,282 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 02:27:30,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:30,400 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 02:27:30,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708043693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:30,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:30,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-06 02:27:30,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225755286] [2022-12-06 02:27:30,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:30,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:27:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:27:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:27:30,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:27:30,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 166 transitions, 2456 flow. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 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 02:27:30,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:30,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:27:30,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:30,747 INFO L130 PetriNetUnfolder]: 1368/2020 cut-off events. [2022-12-06 02:27:30,747 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-12-06 02:27:30,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16397 conditions, 2020 events. 1368/2020 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7732 event pairs, 351 based on Foata normal form. 1/1494 useless extension candidates. Maximal degree in co-relation 8572. Up to 1595 conditions per place. [2022-12-06 02:27:30,765 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 119 selfloop transitions, 6 changer transitions 55/180 dead transitions. [2022-12-06 02:27:30,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 180 transitions, 3024 flow [2022-12-06 02:27:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 02:27:30,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38285714285714284 [2022-12-06 02:27:30,767 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 02:27:30,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:30,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 180 transitions, 3024 flow [2022-12-06 02:27:30,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 180 transitions, 3024 flow [2022-12-06 02:27:30,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:30,783 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:30,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 02:27:30,784 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 180 transitions, 3024 flow [2022-12-06 02:27:30,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 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 02:27:30,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:30,784 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] [2022-12-06 02:27:30,801 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 02:27:30,991 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 02:27:30,991 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 02:27:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1792857838, now seen corresponding path program 2 times [2022-12-06 02:27:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209927947] [2022-12-06 02:27:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:31,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209927947] [2022-12-06 02:27:31,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209927947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:31,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956407923] [2022-12-06 02:27:31,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:31,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:31,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:31,348 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 02:27:31,427 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 02:27:31,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:31,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:31,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:27:31,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:31,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:31,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:31,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 302 [2022-12-06 02:27:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:32,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956407923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:32,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:32,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-06 02:27:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513125620] [2022-12-06 02:27:32,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:27:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:27:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:27:32,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:27:32,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 180 transitions, 3024 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 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 02:27:32,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:32,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:27:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:33,026 INFO L130 PetriNetUnfolder]: 2444/3715 cut-off events. [2022-12-06 02:27:33,026 INFO L131 PetriNetUnfolder]: For 417/417 co-relation queries the response was YES. [2022-12-06 02:27:33,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33913 conditions, 3715 events. 2444/3715 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16914 event pairs, 819 based on Foata normal form. 0/2904 useless extension candidates. Maximal degree in co-relation 13694. Up to 2864 conditions per place. [2022-12-06 02:27:33,044 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 179 selfloop transitions, 17 changer transitions 147/343 dead transitions. [2022-12-06 02:27:33,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 343 transitions, 6462 flow [2022-12-06 02:27:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:27:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:27:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2022-12-06 02:27:33,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36883116883116884 [2022-12-06 02:27:33,047 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-06 02:27:33,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:33,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 343 transitions, 6462 flow [2022-12-06 02:27:33,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 343 transitions, 6462 flow [2022-12-06 02:27:33,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:33,072 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:33,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 02:27:33,075 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 343 transitions, 6462 flow [2022-12-06 02:27:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 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 02:27:33,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:33,076 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 02:27:33,099 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 02:27:33,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:33,281 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 02:27:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 351159985, now seen corresponding path program 1 times [2022-12-06 02:27:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:33,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79011172] [2022-12-06 02:27:33,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:34,389 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 02:27:34,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79011172] [2022-12-06 02:27:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79011172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409922599] [2022-12-06 02:27:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:34,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:34,396 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 02:27:34,398 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 02:27:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:34,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 02:27:34,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:34,552 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 02:27:34,650 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 02:27:34,701 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 02:27:34,803 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 02:27:34,870 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 02:27:34,996 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 02:27:34,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:40,125 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 02:27:40,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409922599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:40,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:40,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2022-12-06 02:27:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548661510] [2022-12-06 02:27:40,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:27:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:27:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=412, Unknown=18, NotChecked=0, Total=552 [2022-12-06 02:27:40,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:27:40,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 343 transitions, 6462 flow. Second operand has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 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 02:27:40,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:40,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:27:40,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:47,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:50,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:52,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:54,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:56,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:58,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:27:59,452 INFO L130 PetriNetUnfolder]: 4121/6232 cut-off events. [2022-12-06 02:27:59,452 INFO L131 PetriNetUnfolder]: For 721/721 co-relation queries the response was YES. [2022-12-06 02:27:59,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63092 conditions, 6232 events. 4121/6232 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31737 event pairs, 1170 based on Foata normal form. 5/4855 useless extension candidates. Maximal degree in co-relation 18904. Up to 5379 conditions per place. [2022-12-06 02:27:59,476 INFO L137 encePairwiseOnDemand]: 15/35 looper letters, 302 selfloop transitions, 46 changer transitions 218/566 dead transitions. [2022-12-06 02:27:59,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 566 transitions, 11791 flow [2022-12-06 02:27:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:27:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:27:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 237 transitions. [2022-12-06 02:27:59,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28214285714285714 [2022-12-06 02:27:59,479 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 02:27:59,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:59,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 566 transitions, 11791 flow [2022-12-06 02:27:59,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 566 transitions, 11791 flow [2022-12-06 02:27:59,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:26,105 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 02:29:26,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86626 [2022-12-06 02:29:26,105 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 555 transitions, 11571 flow [2022-12-06 02:29:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 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 02:29:26,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:26,106 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] [2022-12-06 02:29:26,111 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 02:29:26,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:26,307 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 02:29:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -401467922, now seen corresponding path program 1 times [2022-12-06 02:29:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:26,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85889113] [2022-12-06 02:29:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:26,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:26,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85889113] [2022-12-06 02:29:26,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85889113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:26,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094496528] [2022-12-06 02:29:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:26,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:26,704 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 02:29:26,720 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 02:29:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:26,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:29:26,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:27,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:27,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:27,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 02:29:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:28,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094496528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:28,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:28,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 02:29:28,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669094947] [2022-12-06 02:29:28,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:29:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:28,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:29:28,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:29:28,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:29:28,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 555 transitions, 11571 flow. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 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 02:29:28,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:28,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:29:28,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:30,368 INFO L130 PetriNetUnfolder]: 5229/7887 cut-off events. [2022-12-06 02:29:30,368 INFO L131 PetriNetUnfolder]: For 941/941 co-relation queries the response was YES. [2022-12-06 02:29:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87665 conditions, 7887 events. 5229/7887 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 41896 event pairs, 1170 based on Foata normal form. 0/6135 useless extension candidates. Maximal degree in co-relation 25826. Up to 7038 conditions per place. [2022-12-06 02:29:30,408 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 436 selfloop transitions, 34 changer transitions 220/690 dead transitions. [2022-12-06 02:29:30,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 690 transitions, 15759 flow [2022-12-06 02:29:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:29:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:29:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-06 02:29:30,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.422360248447205 [2022-12-06 02:29:30,409 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-06 02:29:30,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:30,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 690 transitions, 15759 flow [2022-12-06 02:29:30,454 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 690 transitions, 15759 flow [2022-12-06 02:29:30,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:30,457 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:30,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 02:29:30,457 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 690 transitions, 15759 flow [2022-12-06 02:29:30,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 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 02:29:30,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:30,458 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] [2022-12-06 02:29:30,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:30,663 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,SelfDestructingSolverStorable9 [2022-12-06 02:29:30,664 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 02:29:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1105366805, now seen corresponding path program 1 times [2022-12-06 02:29:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:30,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466746767] [2022-12-06 02:29:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:31,499 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 02:29:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466746767] [2022-12-06 02:29:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466746767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396192171] [2022-12-06 02:29:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:31,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:31,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:31,516 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 02:29:31,517 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 02:29:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:29:31,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:31,768 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 02:29:31,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:32,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:32,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 439 treesize of output 630 [2022-12-06 02:29:37,833 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 02:29:37,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396192171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:37,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:37,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-12-06 02:29:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75561692] [2022-12-06 02:29:37,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:37,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:29:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:37,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:29:37,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:29:37,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:29:37,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 690 transitions, 15759 flow. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 02:29:37,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:37,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:29:37,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:39,886 INFO L130 PetriNetUnfolder]: 6021/9135 cut-off events. [2022-12-06 02:29:39,886 INFO L131 PetriNetUnfolder]: For 1094/1094 co-relation queries the response was YES. [2022-12-06 02:29:39,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110709 conditions, 9135 events. 6021/9135 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50607 event pairs, 1521 based on Foata normal form. 4/7189 useless extension candidates. Maximal degree in co-relation 28164. Up to 8286 conditions per place. [2022-12-06 02:29:39,924 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 479 selfloop transitions, 46 changer transitions 275/800 dead transitions. [2022-12-06 02:29:39,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 800 transitions, 19887 flow [2022-12-06 02:29:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:29:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:29:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2022-12-06 02:29:39,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38858695652173914 [2022-12-06 02:29:39,926 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 02:29:39,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:39,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 800 transitions, 19887 flow [2022-12-06 02:29:39,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 800 transitions, 19887 flow [2022-12-06 02:29:39,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:39,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:39,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 02:29:39,976 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 800 transitions, 19887 flow [2022-12-06 02:29:39,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 02:29:39,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:39,977 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] [2022-12-06 02:29:39,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 02:29:40,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:40,182 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 02:29:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash -585417799, now seen corresponding path program 1 times [2022-12-06 02:29:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:40,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507059176] [2022-12-06 02:29:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:40,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507059176] [2022-12-06 02:29:40,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507059176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:40,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267994564] [2022-12-06 02:29:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:40,477 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 02:29:40,479 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 02:29:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:40,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:29:40,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:40,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:29:40,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267994564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:40,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:29:40,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 02:29:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020456473] [2022-12-06 02:29:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:40,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:29:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:29:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:29:40,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:29:40,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 800 transitions, 19887 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 02:29:40,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:40,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:29:40,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:42,835 INFO L130 PetriNetUnfolder]: 7103/10879 cut-off events. [2022-12-06 02:29:42,835 INFO L131 PetriNetUnfolder]: For 1383/1383 co-relation queries the response was YES. [2022-12-06 02:29:42,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142749 conditions, 10879 events. 7103/10879 cut-off events. For 1383/1383 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 62826 event pairs, 1894 based on Foata normal form. 0/8701 useless extension candidates. Maximal degree in co-relation 27790. Up to 9616 conditions per place. [2022-12-06 02:29:42,893 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 586 selfloop transitions, 9 changer transitions 360/955 dead transitions. [2022-12-06 02:29:42,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 955 transitions, 25670 flow [2022-12-06 02:29:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:29:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:29:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 02:29:42,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-06 02:29:42,895 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 56 predicate places. [2022-12-06 02:29:42,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:42,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 955 transitions, 25670 flow [2022-12-06 02:29:42,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 955 transitions, 25670 flow [2022-12-06 02:29:42,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:42,990 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:42,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 02:29:42,991 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 955 transitions, 25670 flow [2022-12-06 02:29:42,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 02:29:42,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:42,991 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 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 02:29:42,998 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 02:29:43,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:43,199 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 02:29:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -590114273, now seen corresponding path program 1 times [2022-12-06 02:29:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:43,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343402585] [2022-12-06 02:29:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343402585] [2022-12-06 02:29:44,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343402585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570150125] [2022-12-06 02:29:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:44,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:44,213 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 02:29:44,217 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 02:29:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:44,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 02:29:44,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:44,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:45,258 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 02:29:45,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1056 treesize of output 1200 [2022-12-06 02:29:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:50,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570150125] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:50,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 02:29:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969108064] [2022-12-06 02:29:50,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:50,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 02:29:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 02:29:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:29:50,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:29:50,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 955 transitions, 25670 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 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 02:29:50,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:50,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:29:50,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:53,543 INFO L130 PetriNetUnfolder]: 6585/10141 cut-off events. [2022-12-06 02:29:53,543 INFO L131 PetriNetUnfolder]: For 1315/1315 co-relation queries the response was YES. [2022-12-06 02:29:53,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143244 conditions, 10141 events. 6585/10141 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 58356 event pairs, 1894 based on Foata normal form. 0/8167 useless extension candidates. Maximal degree in co-relation 29920. Up to 8874 conditions per place. [2022-12-06 02:29:53,598 INFO L137 encePairwiseOnDemand]: 24/46 looper letters, 481 selfloop transitions, 22 changer transitions 411/914 dead transitions. [2022-12-06 02:29:53,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 914 transitions, 26393 flow [2022-12-06 02:29:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:29:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:29:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2022-12-06 02:29:53,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-06 02:29:53,600 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-06 02:29:53,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:53,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 914 transitions, 26393 flow [2022-12-06 02:29:53,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 914 transitions, 26393 flow [2022-12-06 02:29:53,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:53,684 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:53,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 02:29:53,685 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 914 transitions, 26393 flow [2022-12-06 02:29:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 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 02:29:53,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:53,685 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] [2022-12-06 02:29:53,696 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 02:29:53,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:29:53,891 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 02:29:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1852638876, now seen corresponding path program 1 times [2022-12-06 02:29:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:53,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717305913] [2022-12-06 02:29:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717305913] [2022-12-06 02:29:54,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717305913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270115379] [2022-12-06 02:29:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:54,341 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 02:29:54,355 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 02:29:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:54,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:29:54,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:54,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:29:54,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270115379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:54,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:29:54,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 02:29:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913528873] [2022-12-06 02:29:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:54,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:29:54,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:29:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:29:54,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:29:54,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 914 transitions, 26393 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 02:29:54,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:54,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:29:54,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:58,830 INFO L130 PetriNetUnfolder]: 12717/19695 cut-off events. [2022-12-06 02:29:58,830 INFO L131 PetriNetUnfolder]: For 2585/2585 co-relation queries the response was YES. [2022-12-06 02:29:58,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297806 conditions, 19695 events. 12717/19695 cut-off events. For 2585/2585 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 128692 event pairs, 3298 based on Foata normal form. 0/16097 useless extension candidates. Maximal degree in co-relation 35178. Up to 18155 conditions per place. [2022-12-06 02:29:58,964 INFO L137 encePairwiseOnDemand]: 30/46 looper letters, 988 selfloop transitions, 23 changer transitions 695/1706 dead transitions. [2022-12-06 02:29:58,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1706 transitions, 52725 flow [2022-12-06 02:29:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 02:29:58,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-06 02:29:58,967 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 68 predicate places. [2022-12-06 02:29:58,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:58,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 1706 transitions, 52725 flow [2022-12-06 02:29:59,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 1706 transitions, 52725 flow [2022-12-06 02:29:59,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:59,181 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:59,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 02:29:59,182 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 1706 transitions, 52725 flow [2022-12-06 02:29:59,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 02:29:59,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:59,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:59,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:59,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:29:59,401 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 02:29:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1914678490, now seen corresponding path program 1 times [2022-12-06 02:29:59,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:59,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991379810] [2022-12-06 02:29:59,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:59,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991379810] [2022-12-06 02:29:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991379810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:59,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860032861] [2022-12-06 02:29:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:59,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:59,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:29:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:59,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:29:59,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:00,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:00,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:00,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 02:30:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:01,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860032861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:01,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:01,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 02:30:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751695976] [2022-12-06 02:30:01,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:01,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:30:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:30:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:30:01,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:30:01,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 1706 transitions, 52725 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 02:30:01,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:01,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:30:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:07,774 INFO L130 PetriNetUnfolder]: 12323/19177 cut-off events. [2022-12-06 02:30:07,774 INFO L131 PetriNetUnfolder]: For 2551/2551 co-relation queries the response was YES. [2022-12-06 02:30:07,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309184 conditions, 19177 events. 12323/19177 cut-off events. For 2551/2551 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 125673 event pairs, 3298 based on Foata normal form. 0/15809 useless extension candidates. Maximal degree in co-relation 31612. Up to 17637 conditions per place. [2022-12-06 02:30:07,873 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 933 selfloop transitions, 36 changer transitions 701/1670 dead transitions. [2022-12-06 02:30:07,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1670 transitions, 54961 flow [2022-12-06 02:30:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:30:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:30:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 02:30:07,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-06 02:30:07,874 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 71 predicate places. [2022-12-06 02:30:07,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:07,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 1670 transitions, 54961 flow [2022-12-06 02:30:08,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 1670 transitions, 54961 flow [2022-12-06 02:30:08,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:08,124 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:08,124 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 02:30:08,125 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 1670 transitions, 54961 flow [2022-12-06 02:30:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 02:30:08,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:08,125 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] [2022-12-06 02:30:08,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:08,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:30:08,328 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 02:30:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1708766050, now seen corresponding path program 1 times [2022-12-06 02:30:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:08,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049383066] [2022-12-06 02:30:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049383066] [2022-12-06 02:30:08,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049383066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839879955] [2022-12-06 02:30:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:08,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:08,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:08,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:30:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:08,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:30:08,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:09,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:10,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:10,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 850 [2022-12-06 02:30:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:15,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839879955] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:15,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:15,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 02:30:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179166195] [2022-12-06 02:30:15,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:15,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:30:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:30:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:30:15,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 02:30:15,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 1670 transitions, 54961 flow. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 02:30:15,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:15,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 02:30:15,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:22,657 INFO L130 PetriNetUnfolder]: 12178/19307 cut-off events. [2022-12-06 02:30:22,657 INFO L131 PetriNetUnfolder]: For 2666/2666 co-relation queries the response was YES. [2022-12-06 02:30:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330707 conditions, 19307 events. 12178/19307 cut-off events. For 2666/2666 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 130946 event pairs, 3620 based on Foata normal form. 0/16432 useless extension candidates. Maximal degree in co-relation 33582. Up to 17763 conditions per place. [2022-12-06 02:30:22,753 INFO L137 encePairwiseOnDemand]: 23/46 looper letters, 738 selfloop transitions, 124 changer transitions 865/1727 dead transitions. [2022-12-06 02:30:22,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 1727 transitions, 60311 flow [2022-12-06 02:30:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:30:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:30:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 158 transitions. [2022-12-06 02:30:22,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2020460358056266 [2022-12-06 02:30:22,755 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2022-12-06 02:30:22,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:22,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 1727 transitions, 60311 flow [2022-12-06 02:30:22,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 1727 transitions, 60311 flow [2022-12-06 02:30:22,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:39,965 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:30:39,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17211 [2022-12-06 02:30:39,966 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 1725 transitions, 60243 flow [2022-12-06 02:30:39,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 02:30:39,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:39,966 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 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 02:30:39,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:40,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:30:40,167 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 02:30:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1320489092, now seen corresponding path program 1 times [2022-12-06 02:30:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539481686] [2022-12-06 02:30:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:30:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:40,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539481686] [2022-12-06 02:30:40,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539481686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:40,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781097507] [2022-12-06 02:30:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:40,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:40,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:40,665 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:40,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:30:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:40,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:30:40,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:30:41,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:41,966 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 02:30:41,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1056 treesize of output 1200 [2022-12-06 02:30:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:30:43,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781097507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:43,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:43,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 02:30:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236498356] [2022-12-06 02:30:43,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:43,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:30:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:43,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:30:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:30:43,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:30:43,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1725 transitions, 60243 flow. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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 02:30:43,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:43,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:30:43,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:49,417 INFO L130 PetriNetUnfolder]: 10144/16293 cut-off events. [2022-12-06 02:30:49,417 INFO L131 PetriNetUnfolder]: For 2289/2289 co-relation queries the response was YES. [2022-12-06 02:30:49,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295523 conditions, 16293 events. 10144/16293 cut-off events. For 2289/2289 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 110017 event pairs, 3620 based on Foata normal form. 0/14140 useless extension candidates. Maximal degree in co-relation 35552. Up to 14751 conditions per place. [2022-12-06 02:30:49,486 INFO L137 encePairwiseOnDemand]: 25/48 looper letters, 451 selfloop transitions, 28 changer transitions 1022/1501 dead transitions. [2022-12-06 02:30:49,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 1501 transitions, 55437 flow [2022-12-06 02:30:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:30:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:30:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2022-12-06 02:30:49,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31712962962962965 [2022-12-06 02:30:49,487 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2022-12-06 02:30:49,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:49,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 1501 transitions, 55437 flow [2022-12-06 02:30:49,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 1501 transitions, 55437 flow [2022-12-06 02:30:49,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:49,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:49,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 02:30:49,622 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 1501 transitions, 55437 flow [2022-12-06 02:30:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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 02:30:49,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:49,623 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 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 02:30:49,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:30:49,828 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 02:30:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -450781716, now seen corresponding path program 1 times [2022-12-06 02:30:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875623841] [2022-12-06 02:30:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:50,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875623841] [2022-12-06 02:30:50,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875623841] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:50,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303229441] [2022-12-06 02:30:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:50,812 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:30:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:50,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:30:50,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:51,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:52,881 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 02:30:52,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1138 treesize of output 1258 [2022-12-06 02:33:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:33:00,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303229441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:33:00,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:33:00,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 02:33:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73878551] [2022-12-06 02:33:00,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:33:00,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:33:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:00,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:33:00,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:33:00,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:33:00,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 1501 transitions, 55437 flow. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 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 02:33:00,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:00,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:33:00,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:08,075 INFO L130 PetriNetUnfolder]: 12342/19537 cut-off events. [2022-12-06 02:33:08,076 INFO L131 PetriNetUnfolder]: For 2658/2658 co-relation queries the response was YES. [2022-12-06 02:33:08,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373708 conditions, 19537 events. 12342/19537 cut-off events. For 2658/2658 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 130896 event pairs, 3620 based on Foata normal form. 0/16580 useless extension candidates. Maximal degree in co-relation 37522. Up to 17995 conditions per place. [2022-12-06 02:33:08,172 INFO L137 encePairwiseOnDemand]: 22/48 looper letters, 559 selfloop transitions, 95 changer transitions 1094/1748 dead transitions. [2022-12-06 02:33:08,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1748 transitions, 68029 flow [2022-12-06 02:33:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:33:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:33:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 318 transitions. [2022-12-06 02:33:08,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28804347826086957 [2022-12-06 02:33:08,184 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 114 predicate places. [2022-12-06 02:33:08,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:08,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 1748 transitions, 68029 flow [2022-12-06 02:33:08,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 1748 transitions, 68029 flow [2022-12-06 02:33:08,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:08,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:08,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 02:33:08,362 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 1748 transitions, 68029 flow [2022-12-06 02:33:08,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 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 02:33:08,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:08,363 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] [2022-12-06 02:33:08,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:33:08,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 02:33:08,568 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 02:33:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 44257111, now seen corresponding path program 2 times [2022-12-06 02:33:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:08,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383080520] [2022-12-06 02:33:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383080520] [2022-12-06 02:33:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383080520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:10,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583453998] [2022-12-06 02:33:10,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:33:10,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:10,040 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:10,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:33:10,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:33:10,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:33:10,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 02:33:10,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:10,326 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-06 02:33:10,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-06 02:33:10,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 02:33:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-06 02:33:10,354 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:33:10,355 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2022-12-06 02:33:10,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-12-06 02:33:10,369 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 02:33:10,447 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 02:33:10,491 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 02:33:10,523 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 02:33:10,564 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 02:33:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:33:10,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:33:40,086 WARN L233 SmtUtils]: Spent 24.09s on a formula simplification. DAG size of input: 154 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:33:54,128 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:34:01,790 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:34:11,034 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 154 DAG size of output: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:34:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:34:11,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583453998] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:34:11,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:34:11,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-12-06 02:34:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787104596] [2022-12-06 02:34:11,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:34:11,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:34:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:34:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:34:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=474, Unknown=31, NotChecked=0, Total=650 [2022-12-06 02:34:11,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 02:34:11,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1748 transitions, 68029 flow. Second operand has 26 states, 25 states have (on average 3.24) internal successors, (81), 25 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 02:34:11,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:34:11,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 02:34:11,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:37:07,049 WARN L233 SmtUtils]: Spent 2.92m on a formula simplification. DAG size of input: 499 DAG size of output: 398 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:37:10,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (= c_~node1_state~0 0))) (let ((.cse14 (<= c_~node1_back~0 c_~node1_front~0)) (.cse15 (<= c_~node1_size~0 c_~node1_front~0)) (.cse7 (< c_~node1_front~0 0)) (.cse23 (not .cse10)) (.cse31 (= c_~node1_state~0 1))) (let ((.cse0 (= c_~manager_state~0 1)) (.cse12 (= c_~manager_state~0 0)) (.cse1 (not (<= 0 c_~node1_back~0))) (.cse6 (+ c_~node1~0.offset (* c_~node1_back~0 4))) (.cse8 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse11 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse17 (= 3 c_~manager_state~0)) (.cse5 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse27 (or .cse10 .cse31)) (.cse16 (= 2 c_~manager_state~0)) (.cse24 (not .cse31)) (.cse26 (or .cse14 .cse15 .cse7 .cse23)) (.cse13 (= c_~manager_state~0 4))) (and (or (not .cse0) .cse1 (and (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (~node2~0.base Int) (~node2~0.offset Int) (v_~node2_back~0_194 Int)) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (let ((.cse4 (select .cse2 c_~node1~0.base))) (let ((.cse3 (select .cse4 .cse6))) (or (not (<= 0 v_~node2_back~0_194)) (not (= (select (select .cse2 ~node2~0.base) (+ ~node2~0.offset (* v_~node2_back~0_194 4))) .cse3)) (= .cse3 (select .cse4 .cse5))))))) .cse7 .cse8) (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (~node2~0.base Int) (~node2~0.offset Int) (v_~node2_back~0_194 Int)) (or (not (<= 0 v_~node2_back~0_194)) (not (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (= (select (select .cse9 ~node2~0.base) (+ ~node2~0.offset (* v_~node2_back~0_194 4))) (select (select .cse9 c_~node1~0.base) .cse6)))))) .cse10)) .cse11) (or .cse0 .cse12 .cse13 (and (or .cse14 .cse15 .cse7) .cse10) .cse16 .cse17) (or (not .cse12) .cse1 (and (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~manager~0.offset Int)) (or (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (= (select (select .cse18 c_~node1~0.base) .cse6) (select (select .cse18 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_228 4) (- 4))))) (< v_~manager_front~0_228 1))) .cse10) (or .cse7 .cse8 (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~manager~0.offset Int)) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (let ((.cse21 (select .cse20 c_~node1~0.base))) (let ((.cse19 (select .cse21 .cse6))) (or (= .cse19 (select (select .cse20 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_228 4) (- 4)))) (= .cse19 (select .cse21 .cse5)) (< v_~manager_front~0_228 1))))))) (or .cse7 (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526) c_~node1~0.base))) (= (select .cse22 .cse6) (select .cse22 .cse5)))) .cse8 .cse23)) .cse11) (or (not .cse17) (and (or .cse24 (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~manager_back~0 Int) (~manager~0.offset Int)) (or (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526) c_~manager~0.base))) (= (select .cse25 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse25 (+ ~manager~0.offset (* v_~manager_front~0_228 4))))) (< v_~manager_front~0_228 1) (<= ~manager_back~0 v_~manager_front~0_228)))) .cse26 .cse27)) (or (and (or .cse14 (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (~node2~0.base Int) (~node2~0.offset Int) (v_~node2_back~0_194 Int)) (or (not (<= 1 v_~node2_back~0_194)) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (= (select (select .cse28 ~node2~0.base) (+ ~node2~0.offset (- 4) (* v_~node2_back~0_194 4))) (select (select .cse28 c_~node1~0.base) .cse5))))) .cse15 .cse7 .cse23) .cse27 (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~manager_back~0 Int) (~manager~0.offset Int)) (or (< v_~manager_front~0_228 0) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526) c_~manager~0.base))) (= (select .cse29 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse29 (+ ~manager~0.offset (* v_~manager_front~0_228 4))))) (<= ~manager_back~0 v_~manager_front~0_228))) .cse24)) (not .cse16)) (= c_~safe~0 1) (or (and (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~client~0.base Int) (v_~client_back~0_185 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (= (select (select .cse30 ~client~0.base) (+ (* v_~client_back~0_185 4) ~client~0.offset)) (select (select .cse30 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_228 4) (- 4))))) (< v_~manager_front~0_228 1) (not (<= 0 v_~client_back~0_185)))) .cse10 .cse31) (or (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_~manager_front~0_228 Int) (~manager_back~0 Int) (~client~0.base Int) (v_~client_back~0_185 Int) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1526))) (let ((.cse32 (select (select .cse34 ~client~0.base) (+ (* v_~client_back~0_185 4) ~client~0.offset))) (.cse33 (select .cse34 c_~manager~0.base))) (or (<= (+ ~manager_back~0 1) v_~manager_front~0_228) (= .cse32 (select .cse33 (+ ~manager~0.offset (* v_~manager_front~0_228 4) (- 4)))) (not (= .cse32 (select .cse33 (+ ~manager~0.offset (* ~manager_back~0 4))))) (< v_~manager_front~0_228 1) (not (<= 0 v_~client_back~0_185)))))) .cse24) .cse26) (not .cse13)))))) is different from false [2022-12-06 02:37:12,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:16,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:18,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:20,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:22,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:24,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:26,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:28,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:30,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:32,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:35,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:39,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:48,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:50,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:52,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:54,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:56,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:38:00,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:38:02,411 INFO L130 PetriNetUnfolder]: 19382/30839 cut-off events. [2022-12-06 02:38:02,412 INFO L131 PetriNetUnfolder]: For 4447/4447 co-relation queries the response was YES. [2022-12-06 02:38:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620836 conditions, 30839 events. 19382/30839 cut-off events. For 4447/4447 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 223565 event pairs, 4754 based on Foata normal form. 12/26264 useless extension candidates. Maximal degree in co-relation 62100. Up to 28693 conditions per place. [2022-12-06 02:38:02,590 INFO L137 encePairwiseOnDemand]: 15/48 looper letters, 870 selfloop transitions, 106 changer transitions 1870/2846 dead transitions. [2022-12-06 02:38:02,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 2846 transitions, 116483 flow [2022-12-06 02:38:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:38:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:38:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 350 transitions. [2022-12-06 02:38:02,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2514367816091954 [2022-12-06 02:38:02,593 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2022-12-06 02:38:02,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:02,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 2846 transitions, 116483 flow [2022-12-06 02:38:03,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 2846 transitions, 116483 flow [2022-12-06 02:38:03,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:27,184 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:38:27,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24591 [2022-12-06 02:38:27,184 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 2844 transitions, 116403 flow [2022-12-06 02:38:27,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.24) internal successors, (81), 25 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 02:38:27,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:27,185 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 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 02:38:27,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:27,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:27,391 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 02:38:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1130665523, now seen corresponding path program 1 times [2022-12-06 02:38:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:27,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596769563] [2022-12-06 02:38:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596769563] [2022-12-06 02:38:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596769563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368327925] [2022-12-06 02:38:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:29,036 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:29,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:38:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:29,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 02:38:29,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:29,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:32,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:32,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 559 treesize of output 1078 [2022-12-06 02:39:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:10,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368327925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:10,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:10,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 02:39:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615083895] [2022-12-06 02:39:10,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:10,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:39:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:39:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:39:10,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 02:39:10,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 2844 transitions, 116403 flow. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 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 02:39:10,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:10,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 02:39:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:30,965 INFO L130 PetriNetUnfolder]: 21892/34267 cut-off events. [2022-12-06 02:39:30,965 INFO L131 PetriNetUnfolder]: For 4753/4753 co-relation queries the response was YES. [2022-12-06 02:39:31,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723889 conditions, 34267 events. 21892/34267 cut-off events. For 4753/4753 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 244591 event pairs, 4840 based on Foata normal form. 10/28410 useless extension candidates. Maximal degree in co-relation 82702. Up to 32122 conditions per place. [2022-12-06 02:39:31,151 INFO L137 encePairwiseOnDemand]: 28/50 looper letters, 1060 selfloop transitions, 138 changer transitions 1884/3082 dead transitions. [2022-12-06 02:39:31,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 3082 transitions, 132267 flow [2022-12-06 02:39:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:39:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:39:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 381 transitions. [2022-12-06 02:39:31,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.331304347826087 [2022-12-06 02:39:31,153 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 162 predicate places. [2022-12-06 02:39:31,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:31,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 3082 transitions, 132267 flow [2022-12-06 02:39:31,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 3082 transitions, 132267 flow [2022-12-06 02:39:31,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:31,638 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:31,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 484 [2022-12-06 02:39:31,639 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 3082 transitions, 132267 flow [2022-12-06 02:39:31,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 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 02:39:31,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:31,639 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] [2022-12-06 02:39:31,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:31,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:31,845 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 02:39:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -681352360, now seen corresponding path program 1 times [2022-12-06 02:39:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:31,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965030943] [2022-12-06 02:39:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965030943] [2022-12-06 02:39:32,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965030943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:32,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879851761] [2022-12-06 02:39:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:32,808 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:39:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:33,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 02:39:33,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:33,018 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 30 treesize of output 28 [2022-12-06 02:39:33,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 02:39:33,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:39:33,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:39:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:39:33,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:39:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:34,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:52,664 WARN L233 SmtUtils]: Spent 14.82s on a formula simplification. DAG size of input: 154 DAG size of output: 138 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:40:09,831 WARN L233 SmtUtils]: Spent 12.64s on a formula simplification. DAG size of input: 145 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:40:10,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~node1_state~0 0))) (let ((.cse13 (= c_~node1_state~0 1)) (.cse24 (<= c_~node1_back~0 c_~node1_front~0)) (.cse25 (<= c_~node1_size~0 c_~node1_front~0)) (.cse8 (< c_~node1_front~0 0)) (.cse20 (not .cse11)) (.cse28 (+ c_~node1~0.offset (* c_~node1_front~0 4))) (.cse19 (+ c_~node1~0.offset (* c_~node1_back~0 4)))) (let ((.cse9 (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776) c_~node1~0.base))) (= (select .cse30 .cse28) (select .cse30 .cse19))))) (.cse10 (<= (+ c_~node1_back~0 1) c_~node1_front~0)) (.cse6 (not (<= 0 c_~node1_back~0))) (.cse7 (not (< c_~node1_back~0 c_~node1_size~0))) (.cse3 (or .cse24 .cse25 .cse8 .cse20)) (.cse5 (= c_~manager_state~0 1)) (.cse0 (= 5 c_~manager_state~0)) (.cse21 (= c_~manager_state~0 0)) (.cse17 (= c_~manager_state~0 4)) (.cse23 (= 3 c_~manager_state~0)) (.cse1 (not .cse13)) (.cse4 (or .cse11 .cse13)) (.cse26 (= 2 c_~manager_state~0))) (and (or (not .cse0) (and (or .cse1 (forall ((v_~client_back~0_203 Int) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (~manager_back~0 Int) (~client~0.offset Int) (~manager~0.offset Int)) (or (not (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776))) (= (select (select .cse2 c_~client~0.base) (+ (- 4) ~client~0.offset (* v_~client_back~0_203 4))) (select (select .cse2 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (not (<= 1 v_~client_back~0_203)) (< ~manager_back~0 1)))) .cse3 .cse4)) (or (not .cse5) .cse6 .cse7 (and (or .cse8 .cse9 .cse10) .cse11)) (or (and (or .cse11 (forall ((v_~manager_front~0_246 Int) (v_~client_back~0_203 Int) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (or (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776))) (= (select (select .cse12 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_203 4))) (select (select .cse12 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_246 4) (- 4))))) (< v_~manager_front~0_246 1) (not (<= 0 v_~client_back~0_203)))) .cse13) .cse3 (or (forall ((v_~manager_front~0_246 Int) (v_~client_back~0_203 Int) (v_ArrVal_1776 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1775 (Array Int Int)) (~client~0.offset Int) (~manager~0.offset Int)) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776))) (let ((.cse14 (select (select .cse16 c_~client~0.base) (+ ~client~0.offset (* v_~client_back~0_203 4)))) (.cse15 (select .cse16 c_~manager~0.base))) (or (= .cse14 (select .cse15 (+ ~manager~0.offset (* v_~manager_front~0_246 4) (- 4)))) (< v_~manager_front~0_246 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_246) (not (<= 0 v_~client_back~0_203)) (not (= .cse14 (select .cse15 (+ ~manager~0.offset (* ~manager_back~0 4))))))))) .cse1)) (not .cse17)) (or (and (or .cse11 (forall ((v_~manager_front~0_246 Int) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_246 1) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776))) (= (select (select .cse18 c_~manager~0.base) (+ ~manager~0.offset (* v_~manager_front~0_246 4) (- 4))) (select (select .cse18 c_~node1~0.base) .cse19)))))) (or .cse8 .cse9 .cse10 .cse20)) (not .cse21) .cse6 .cse7) (or (and (or (forall ((v_~manager_front~0_246 Int) (v_ArrVal_1776 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1775 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_246 1) (<= ~manager_back~0 v_~manager_front~0_246) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776) c_~manager~0.base))) (= (select .cse22 (+ ~manager~0.offset (* v_~manager_front~0_246 4))) (select .cse22 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse1) .cse3 .cse4) (not .cse23)) (or .cse5 .cse0 .cse21 .cse17 (and (or .cse24 .cse25 .cse8) .cse11) .cse26 .cse23) (or (and (or .cse24 .cse25 .cse8 (forall ((v_~node2_back~0_215 Int) (~node2~0.base Int) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (~node2~0.offset Int)) (or (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776))) (= (select (select .cse27 c_~node1~0.base) .cse28) (select (select .cse27 ~node2~0.base) (+ (* v_~node2_back~0_215 4) ~node2~0.offset (- 4))))) (not (<= 1 v_~node2_back~0_215)))) .cse20) (or .cse1 (forall ((v_~manager_front~0_246 Int) (v_ArrVal_1776 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_1775 (Array Int Int)) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_246) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1776) c_~manager~0.base))) (= (select .cse29 (+ ~manager~0.offset (* v_~manager_front~0_246 4))) (select .cse29 (+ ~manager~0.offset (* ~manager_back~0 4))))) (< v_~manager_front~0_246 0)))) .cse4) (not .cse26)))))) is different from false [2022-12-06 02:40:13,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:40:13,943 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 68 treesize of output 57 [2022-12-06 02:40:13,981 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-12-06 02:40:13,982 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 1720310 treesize of output 1650694 [2022-12-06 02:40:17,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:40:17,809 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 1650678 treesize of output 1224711 [2022-12-06 02:40:21,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:40:21,591 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 1224694 treesize of output 1011719 [2022-12-06 02:40:25,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:40:25,332 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 1011702 treesize of output 958471 [2022-12-06 02:40:28,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:40:28,868 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 958454 treesize of output 851975 [2022-12-06 02:40:45,229 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 580 DAG size of output: 580 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-06 02:40:59,498 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:40:59,498 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 02:40:59,502 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-12-06 02:40:59,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 02:40:59,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 02:40:59,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:59,713 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 02:40:59,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 02:40:59,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 02:40:59,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 02:40:59,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 02:40:59,716 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:59,719 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:40:59,719 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:40:59,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:40:59 BasicIcfg [2022-12-06 02:40:59,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:40:59,726 INFO L158 Benchmark]: Toolchain (without parser) took 840026.47ms. Allocated memory was 221.2MB in the beginning and 3.1GB in the end (delta: 2.8GB). Free memory was 197.8MB in the beginning and 914.6MB in the end (delta: -716.7MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-06 02:40:59,727 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory was 197.4MB in the beginning and 197.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:40:59,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.70ms. Allocated memory is still 221.2MB. Free memory was 197.3MB in the beginning and 180.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 02:40:59,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.21ms. Allocated memory is still 221.2MB. Free memory was 180.5MB in the beginning and 177.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:40:59,728 INFO L158 Benchmark]: Boogie Preprocessor took 48.47ms. Allocated memory is still 221.2MB. Free memory was 177.4MB in the beginning and 174.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:40:59,728 INFO L158 Benchmark]: RCFGBuilder took 819.94ms. Allocated memory was 221.2MB in the beginning and 335.5MB in the end (delta: 114.3MB). Free memory was 174.8MB in the beginning and 303.8MB in the end (delta: -129.0MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2022-12-06 02:40:59,729 INFO L158 Benchmark]: TraceAbstraction took 838790.55ms. Allocated memory was 335.5MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 302.7MB in the beginning and 914.6MB in the end (delta: -611.8MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-06 02:40:59,730 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.10ms. Allocated memory is still 221.2MB. Free memory was 197.4MB in the beginning and 197.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.70ms. Allocated memory is still 221.2MB. Free memory was 197.3MB in the beginning and 180.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.21ms. Allocated memory is still 221.2MB. Free memory was 180.5MB in the beginning and 177.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.47ms. Allocated memory is still 221.2MB. Free memory was 177.4MB in the beginning and 174.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 819.94ms. Allocated memory was 221.2MB in the beginning and 335.5MB in the end (delta: 114.3MB). Free memory was 174.8MB in the beginning and 303.8MB in the end (delta: -129.0MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. * TraceAbstraction took 838790.55ms. Allocated memory was 335.5MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 302.7MB in the beginning and 914.6MB in the end (delta: -611.8MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5s, 291 PlacesBefore, 38 PlacesAfterwards, 315 TransitionsBefore, 33 TransitionsAfterwards, 5184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 196 TrivialYvCompositions, 57 ConcurrentYvCompositions, 21 ChoiceCompositions, 274 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 3610, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 0, Positive unconditional cache size: 4536, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 48 PlacesBefore, 47 PlacesAfterwards, 182 TransitionsBefore, 181 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 52 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 140 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 343 TransitionsBefore, 343 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.6s, 92 PlacesBefore, 79 PlacesAfterwards, 566 TransitionsBefore, 555 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 690 TransitionsBefore, 690 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 800 TransitionsBefore, 800 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 955 TransitionsBefore, 955 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 914 TransitionsBefore, 914 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 1706 TransitionsBefore, 1706 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 1670 TransitionsBefore, 1670 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.1s, 124 PlacesBefore, 122 PlacesAfterwards, 1727 TransitionsBefore, 1725 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 130 PlacesBefore, 130 PlacesAfterwards, 1501 TransitionsBefore, 1501 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 1748 TransitionsBefore, 1748 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.1s, 180 PlacesBefore, 178 PlacesAfterwards, 2846 TransitionsBefore, 2844 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 200 PlacesBefore, 200 PlacesAfterwards, 3082 TransitionsBefore, 3082 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 196]: 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 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 197]: 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 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 198]: 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 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 199]: 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 29 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 347 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: 838.7s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 313.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.7s, HoareTripleCheckerStatistics: 201 mSolverCounterUnknown, 4537 SdHoareTripleChecker+Valid, 61.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4537 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 60.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 866 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6923 IncrementalHoareTripleChecker+Invalid, 7991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 866 mSolverCounterUnsat, 0 mSDtfsCounter, 6923 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 860 GetRequests, 580 SyntacticMatches, 19 SemanticMatches, 261 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 247.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132267occurred in iteration=20, InterpolantAutomatonStates: 202, 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.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 275.5s InterpolantComputationTime, 911 NumberOfCodeBlocks, 911 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1180 ConstructedInterpolants, 46 QuantifiedInterpolants, 32901 SizeOfPredicates, 654 NumberOfNonLiveVariables, 5844 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 47 InterpolantComputations, 8 PerfectInterpolantSequences, 90/174 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