/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/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:24:07,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:24:07,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:24:07,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:24:07,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:24:07,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:24:07,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:24:07,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:24:07,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:24:07,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:24:07,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:24:07,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:24:07,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:24:07,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:24:07,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:24:07,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:24:07,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:24:07,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:24:07,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:24:07,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:24:07,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:24:07,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:24:07,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:24:07,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:24:07,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:24:07,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:24:07,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:24:07,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:24:07,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:24:07,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:24:07,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:24:07,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:24:07,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:24:07,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:24:07,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:24:07,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:24:07,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:24:07,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:24:07,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:24:07,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:24:07,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:24:07,253 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 03:24:07,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:24:07,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:24:07,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:24:07,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:24:07,286 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:24:07,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:24:07,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:24:07,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:24:07,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:24:07,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:24:07,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:24:07,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:24:07,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:24:07,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:24:07,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:24:07,291 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 03:24:07,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:24:07,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:24:07,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:24:07,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:24:07,663 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:24:07,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-12-06 03:24:08,748 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:24:08,936 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:24:08,938 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-12-06 03:24:08,947 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb6b1eff/d9c6308996a4496c90f5b8c03034487d/FLAG73b82ca71 [2022-12-06 03:24:08,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb6b1eff/d9c6308996a4496c90f5b8c03034487d [2022-12-06 03:24:08,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:24:08,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:24:08,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:24:08,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:24:08,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:24:08,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:24:08" (1/1) ... [2022-12-06 03:24:08,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7149f3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:08, skipping insertion in model container [2022-12-06 03:24:08,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:24:08" (1/1) ... [2022-12-06 03:24:08,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:24:09,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:24:09,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:24:09,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:24:09,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:24:09,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:24:09,145 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/test-context1.wvr.c[2433,2446] [2022-12-06 03:24:09,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:24:09,173 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:24:09,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:24:09,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:24:09,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:24:09,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:24:09,210 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/test-context1.wvr.c[2433,2446] [2022-12-06 03:24:09,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:24:09,228 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:24:09,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09 WrapperNode [2022-12-06 03:24:09,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:24:09,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:24:09,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:24:09,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:24:09,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,281 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 131 [2022-12-06 03:24:09,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:24:09,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:24:09,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:24:09,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:24:09,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,320 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:24:09,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:24:09,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:24:09,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:24:09,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (1/1) ... [2022-12-06 03:24:09,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:24:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:09,373 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 03:24:09,408 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 03:24:09,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:24:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:24:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:24:09,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:24:09,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:24:09,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:24:09,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:24:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:24:09,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:24:09,430 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 03:24:09,523 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:24:09,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:24:09,789 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:24:09,909 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:24:09,909 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:24:09,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:24:09 BoogieIcfgContainer [2022-12-06 03:24:09,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:24:09,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:24:09,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:24:09,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:24:09,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:24:08" (1/3) ... [2022-12-06 03:24:09,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54272b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:24:09, skipping insertion in model container [2022-12-06 03:24:09,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:24:09" (2/3) ... [2022-12-06 03:24:09,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54272b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:24:09, skipping insertion in model container [2022-12-06 03:24:09,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:24:09" (3/3) ... [2022-12-06 03:24:09,936 INFO L112 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2022-12-06 03:24:09,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:24:09,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:24:09,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:24:09,991 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:24:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 106 transitions, 228 flow [2022-12-06 03:24:10,070 INFO L130 PetriNetUnfolder]: 9/104 cut-off events. [2022-12-06 03:24:10,071 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:10,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 104 events. 9/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 03:24:10,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 106 transitions, 228 flow [2022-12-06 03:24:10,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 96 transitions, 204 flow [2022-12-06 03:24:10,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:10,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 96 transitions, 204 flow [2022-12-06 03:24:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 204 flow [2022-12-06 03:24:10,112 INFO L130 PetriNetUnfolder]: 9/96 cut-off events. [2022-12-06 03:24:10,112 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:10,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 96 events. 9/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 03:24:10,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 96 transitions, 204 flow [2022-12-06 03:24:10,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 03:24:13,197 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 03:24:13,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:24:13,213 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;@ed203c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:24:13,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:24:13,217 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:24:13,217 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:24:13,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:13,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:13,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2145519978, now seen corresponding path program 1 times [2022-12-06 03:24:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:13,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263423355] [2022-12-06 03:24:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:13,476 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 03:24:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:13,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263423355] [2022-12-06 03:24:13,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263423355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:13,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:13,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 03:24:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652464844] [2022-12-06 03:24:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:13,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:24:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:24:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:24:13,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:24:13,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:13,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:13,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:24:13,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:13,540 INFO L130 PetriNetUnfolder]: 38/71 cut-off events. [2022-12-06 03:24:13,541 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 03:24:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 71 events. 38/71 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 9 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 100. Up to 37 conditions per place. [2022-12-06 03:24:13,543 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-06 03:24:13,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 110 flow [2022-12-06 03:24:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:24:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:24:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 03:24:13,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 03:24:13,557 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 2 predicate places. [2022-12-06 03:24:13,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:13,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 23 transitions, 110 flow [2022-12-06 03:24:13,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 23 transitions, 110 flow [2022-12-06 03:24:13,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:13,562 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:13,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:13,564 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 23 transitions, 110 flow [2022-12-06 03:24:13,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:13,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:13,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:13,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:24:13,565 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash -799611484, now seen corresponding path program 1 times [2022-12-06 03:24:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:13,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113023655] [2022-12-06 03:24:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:13,685 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 03:24:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113023655] [2022-12-06 03:24:13,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113023655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:13,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:13,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:24:13,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60142667] [2022-12-06 03:24:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:13,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:24:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:24:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:24:13,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:24:13,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 23 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:13,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:13,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:24:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:13,755 INFO L130 PetriNetUnfolder]: 52/102 cut-off events. [2022-12-06 03:24:13,755 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 03:24:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 102 events. 52/102 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 259 event pairs, 9 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 224. Up to 74 conditions per place. [2022-12-06 03:24:13,757 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 23 selfloop transitions, 2 changer transitions 7/32 dead transitions. [2022-12-06 03:24:13,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 32 transitions, 219 flow [2022-12-06 03:24:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:24:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:24:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 03:24:13,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 03:24:13,759 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 4 predicate places. [2022-12-06 03:24:13,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:13,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 32 transitions, 219 flow [2022-12-06 03:24:13,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 32 transitions, 219 flow [2022-12-06 03:24:13,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:13,765 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:13,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:24:13,767 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 32 transitions, 219 flow [2022-12-06 03:24:13,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:13,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:13,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:13,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:24:13,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1493615899, now seen corresponding path program 1 times [2022-12-06 03:24:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:13,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669516527] [2022-12-06 03:24:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:13,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669516527] [2022-12-06 03:24:13,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669516527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:13,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:24:13,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:24:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686982634] [2022-12-06 03:24:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:13,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:24:13,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:24:13,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 32 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:13,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:13,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:24:13,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:14,038 INFO L130 PetriNetUnfolder]: 61/130 cut-off events. [2022-12-06 03:24:14,038 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 03:24:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 130 events. 61/130 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 391 event pairs, 18 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 296. Up to 103 conditions per place. [2022-12-06 03:24:14,039 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 24 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2022-12-06 03:24:14,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 43 transitions, 383 flow [2022-12-06 03:24:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 03:24:14,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 03:24:14,042 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 7 predicate places. [2022-12-06 03:24:14,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:14,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 43 transitions, 383 flow [2022-12-06 03:24:14,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 43 transitions, 383 flow [2022-12-06 03:24:14,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:15,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:15,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1091 [2022-12-06 03:24:15,133 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 42 transitions, 375 flow [2022-12-06 03:24:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:15,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:15,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:24:15,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 988057274, now seen corresponding path program 1 times [2022-12-06 03:24:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:15,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909831443] [2022-12-06 03:24:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:15,320 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 03:24:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909831443] [2022-12-06 03:24:15,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909831443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998223420] [2022-12-06 03:24:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:15,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:15,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:15,337 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 03:24:15,368 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 03:24:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:15,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 03:24:15,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:15,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 03:24:15,525 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 03:24:15,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:15,548 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-06 03:24:15,548 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 27 treesize of output 13 [2022-12-06 03:24:15,560 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 03:24:15,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998223420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:15,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:15,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2022-12-06 03:24:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215371310] [2022-12-06 03:24:15,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:15,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 03:24:15,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 03:24:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:24:15,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 03:24:15,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 42 transitions, 375 flow. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 03:24:15,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:15,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 03:24:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:15,651 INFO L130 PetriNetUnfolder]: 95/191 cut-off events. [2022-12-06 03:24:15,652 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 03:24:15,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 191 events. 95/191 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 652 event pairs, 22 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 592. Up to 165 conditions per place. [2022-12-06 03:24:15,653 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 6 changer transitions 21/59 dead transitions. [2022-12-06 03:24:15,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 59 transitions, 644 flow [2022-12-06 03:24:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 03:24:15,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 03:24:15,656 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2022-12-06 03:24:15,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:15,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 59 transitions, 644 flow [2022-12-06 03:24:15,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 59 transitions, 644 flow [2022-12-06 03:24:15,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:15,658 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:15,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 03:24:15,659 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 59 transitions, 644 flow [2022-12-06 03:24:15,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 03:24:15,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:15,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:15,668 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 03:24:15,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:15,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash -724110050, now seen corresponding path program 2 times [2022-12-06 03:24:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:15,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473081234] [2022-12-06 03:24:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:16,101 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 03:24:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:16,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473081234] [2022-12-06 03:24:16,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473081234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:16,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994147536] [2022-12-06 03:24:16,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:16,104 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 03:24:16,106 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 03:24:16,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:16,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:16,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 03:24:16,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:16,185 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 03:24:16,213 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 03:24:16,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:16,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:24:16,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 03:24:16,293 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 03:24:16,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994147536] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:16,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:16,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 03:24:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864201517] [2022-12-06 03:24:16,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:16,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:24:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:24:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=135, Unknown=4, NotChecked=0, Total=182 [2022-12-06 03:24:16,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 03:24:16,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 59 transitions, 644 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 03:24:16,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:16,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 03:24:16,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:16,525 INFO L130 PetriNetUnfolder]: 111/220 cut-off events. [2022-12-06 03:24:16,526 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 03:24:16,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 220 events. 111/220 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 773 event pairs, 22 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 828. Up to 194 conditions per place. [2022-12-06 03:24:16,527 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 38 selfloop transitions, 6 changer transitions 23/67 dead transitions. [2022-12-06 03:24:16,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 67 transitions, 864 flow [2022-12-06 03:24:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 03:24:16,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 03:24:16,529 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 14 predicate places. [2022-12-06 03:24:16,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:16,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 67 transitions, 864 flow [2022-12-06 03:24:16,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 67 transitions, 864 flow [2022-12-06 03:24:16,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:16,531 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:16,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 03:24:16,532 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 67 transitions, 864 flow [2022-12-06 03:24:16,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 03:24:16,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:16,532 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:16,552 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 03:24:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:16,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 563480670, now seen corresponding path program 3 times [2022-12-06 03:24:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:16,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884359431] [2022-12-06 03:24:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:16,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884359431] [2022-12-06 03:24:16,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884359431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:16,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945379314] [2022-12-06 03:24:16,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:24:16,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:16,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:16,790 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 03:24:16,792 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 03:24:16,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:24:16,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:16,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:24:16,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:16,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945379314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:16,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:16,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-12-06 03:24:16,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343795924] [2022-12-06 03:24:16,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:16,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:24:16,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:24:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:24:16,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 03:24:16,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 67 transitions, 864 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 03:24:16,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:16,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 03:24:16,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:16,968 INFO L130 PetriNetUnfolder]: 227/448 cut-off events. [2022-12-06 03:24:16,969 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-06 03:24:16,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 448 events. 227/448 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1975 event pairs, 26 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 2092. Up to 422 conditions per place. [2022-12-06 03:24:16,972 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 71 selfloop transitions, 15 changer transitions 47/133 dead transitions. [2022-12-06 03:24:16,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 133 transitions, 1976 flow [2022-12-06 03:24:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 03:24:16,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-06 03:24:16,976 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 17 predicate places. [2022-12-06 03:24:16,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:16,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 133 transitions, 1976 flow [2022-12-06 03:24:16,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 133 transitions, 1976 flow [2022-12-06 03:24:16,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:16,981 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:16,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 03:24:16,981 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 133 transitions, 1976 flow [2022-12-06 03:24:16,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 03:24:16,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:16,982 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:16,990 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 03:24:17,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:17,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1050180519, now seen corresponding path program 4 times [2022-12-06 03:24:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:17,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143092175] [2022-12-06 03:24:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143092175] [2022-12-06 03:24:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143092175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836554903] [2022-12-06 03:24:17,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:24:17,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:17,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:17,275 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 03:24:17,277 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 03:24:17,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:24:17,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:17,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:24:17,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:17,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:17,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836554903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:17,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:17,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 03:24:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522091846] [2022-12-06 03:24:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:24:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:24:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:24:17,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 03:24:17,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 133 transitions, 1976 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:17,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:17,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 03:24:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:17,521 INFO L130 PetriNetUnfolder]: 335/687 cut-off events. [2022-12-06 03:24:17,521 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 03:24:17,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 687 events. 335/687 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3576 event pairs, 39 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 2388. Up to 661 conditions per place. [2022-12-06 03:24:17,524 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 118 selfloop transitions, 12 changer transitions 76/206 dead transitions. [2022-12-06 03:24:17,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 206 transitions, 3476 flow [2022-12-06 03:24:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 03:24:17,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:24:17,525 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 21 predicate places. [2022-12-06 03:24:17,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:17,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 206 transitions, 3476 flow [2022-12-06 03:24:17,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 206 transitions, 3476 flow [2022-12-06 03:24:17,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:19,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:19,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1906 [2022-12-06 03:24:19,431 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 205 transitions, 3460 flow [2022-12-06 03:24:19,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:19,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:19,431 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:19,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:19,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:19,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 654168897, now seen corresponding path program 1 times [2022-12-06 03:24:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:19,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173304205] [2022-12-06 03:24:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173304205] [2022-12-06 03:24:19,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173304205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724288060] [2022-12-06 03:24:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:19,730 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 03:24:19,731 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 03:24:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:19,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 03:24:19,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:19,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:19,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724288060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:19,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:19,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 03:24:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646940172] [2022-12-06 03:24:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:24:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:24:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:24:19,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:19,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 205 transitions, 3460 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:19,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:19,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:19,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:20,041 INFO L130 PetriNetUnfolder]: 281/578 cut-off events. [2022-12-06 03:24:20,041 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 03:24:20,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 578 events. 281/578 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2905 event pairs, 35 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 2684. Up to 552 conditions per place. [2022-12-06 03:24:20,044 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 86 selfloop transitions, 0 changer transitions 87/173 dead transitions. [2022-12-06 03:24:20,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 173 transitions, 3270 flow [2022-12-06 03:24:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:24:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:24:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 03:24:20,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-06 03:24:20,046 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 23 predicate places. [2022-12-06 03:24:20,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:20,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 173 transitions, 3270 flow [2022-12-06 03:24:20,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 173 transitions, 3270 flow [2022-12-06 03:24:20,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:20,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:20,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 03:24:20,053 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 173 transitions, 3270 flow [2022-12-06 03:24:20,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:20,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:20,053 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:20,073 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 03:24:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:20,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 29112165, now seen corresponding path program 1 times [2022-12-06 03:24:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621787778] [2022-12-06 03:24:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621787778] [2022-12-06 03:24:20,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621787778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955471589] [2022-12-06 03:24:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:20,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 03:24:20,527 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 03:24:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:20,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 03:24:20,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:20,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:24:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:20,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:20,665 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-06 03:24:20,665 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 28 treesize of output 13 [2022-12-06 03:24:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:20,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955471589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:20,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:20,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2022-12-06 03:24:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092875043] [2022-12-06 03:24:20,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:20,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:24:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:20,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:24:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:24:20,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:20,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 173 transitions, 3270 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 03:24:20,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:20,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:20,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:21,067 INFO L130 PetriNetUnfolder]: 395/783 cut-off events. [2022-12-06 03:24:21,068 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 03:24:21,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 783 events. 395/783 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4105 event pairs, 39 based on Foata normal form. 5/572 useless extension candidates. Maximal degree in co-relation 4424. Up to 757 conditions per place. [2022-12-06 03:24:21,072 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 84 selfloop transitions, 27 changer transitions 117/228 dead transitions. [2022-12-06 03:24:21,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 228 transitions, 4761 flow [2022-12-06 03:24:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:24:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:24:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-12-06 03:24:21,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5051903114186851 [2022-12-06 03:24:21,074 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 39 predicate places. [2022-12-06 03:24:21,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:21,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 228 transitions, 4761 flow [2022-12-06 03:24:21,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 228 transitions, 4761 flow [2022-12-06 03:24:21,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:21,083 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:21,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:24:21,083 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 228 transitions, 4761 flow [2022-12-06 03:24:21,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 03:24:21,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:21,084 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:21,096 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 03:24:21,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:21,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -262654305, now seen corresponding path program 2 times [2022-12-06 03:24:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:21,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165597197] [2022-12-06 03:24:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165597197] [2022-12-06 03:24:21,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165597197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329671255] [2022-12-06 03:24:21,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:21,607 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 03:24:21,609 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 03:24:21,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:21,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:21,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 03:24:21,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:21,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:24:21,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:24:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:21,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:21,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)) 5)) is different from false [2022-12-06 03:24:21,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:24:21,856 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 47 treesize of output 37 [2022-12-06 03:24:21,862 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 10 treesize of output 3 [2022-12-06 03:24:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 03:24:21,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329671255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:21,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:21,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 03:24:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517220246] [2022-12-06 03:24:21,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:21,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:24:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:24:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-12-06 03:24:21,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:21,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 228 transitions, 4761 flow. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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 03:24:21,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:21,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:21,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:22,478 INFO L130 PetriNetUnfolder]: 453/878 cut-off events. [2022-12-06 03:24:22,479 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 03:24:22,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9807 conditions, 878 events. 453/878 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4617 event pairs, 41 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 5744. Up to 852 conditions per place. [2022-12-06 03:24:22,484 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 93 selfloop transitions, 39 changer transitions 122/254 dead transitions. [2022-12-06 03:24:22,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 254 transitions, 5804 flow [2022-12-06 03:24:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:24:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:24:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 98 transitions. [2022-12-06 03:24:22,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2022-12-06 03:24:22,486 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 50 predicate places. [2022-12-06 03:24:22,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:22,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 254 transitions, 5804 flow [2022-12-06 03:24:22,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 254 transitions, 5804 flow [2022-12-06 03:24:22,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:22,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:22,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 03:24:22,496 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 254 transitions, 5804 flow [2022-12-06 03:24:22,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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 03:24:22,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:22,496 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:22,503 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 03:24:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:22,702 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 900953363, now seen corresponding path program 3 times [2022-12-06 03:24:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742465220] [2022-12-06 03:24:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742465220] [2022-12-06 03:24:22,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742465220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777013068] [2022-12-06 03:24:22,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:24:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:22,780 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 03:24:22,785 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 03:24:22,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:24:22,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:22,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:24:22,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:23,017 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-12-06 03:24:23,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2022-12-06 03:24:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:23,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:23,170 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-12-06 03:24:23,170 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 43 treesize of output 35 [2022-12-06 03:24:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:23,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777013068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:23,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:23,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 03:24:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012932530] [2022-12-06 03:24:23,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:23,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:24:23,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:24:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:24:23,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:24:23,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 254 transitions, 5804 flow. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:23,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:23,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:24:23,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:24,135 INFO L130 PetriNetUnfolder]: 1328/2529 cut-off events. [2022-12-06 03:24:24,135 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-06 03:24:24,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30703 conditions, 2529 events. 1328/2529 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16282 event pairs, 46 based on Foata normal form. 8/1763 useless extension candidates. Maximal degree in co-relation 16980. Up to 2503 conditions per place. [2022-12-06 03:24:24,150 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 171 selfloop transitions, 75 changer transitions 488/734 dead transitions. [2022-12-06 03:24:24,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 734 transitions, 18204 flow [2022-12-06 03:24:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:24:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:24:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 203 transitions. [2022-12-06 03:24:24,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4776470588235294 [2022-12-06 03:24:24,153 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 74 predicate places. [2022-12-06 03:24:24,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:24,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 734 transitions, 18204 flow [2022-12-06 03:24:24,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 734 transitions, 18204 flow [2022-12-06 03:24:24,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:26,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:26,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1989 [2022-12-06 03:24:26,142 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 733 transitions, 18180 flow [2022-12-06 03:24:26,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:26,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:26,143 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:26,152 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 03:24:26,343 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,SelfDestructingSolverStorable10 [2022-12-06 03:24:26,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1776146294, now seen corresponding path program 1 times [2022-12-06 03:24:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:26,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128376451] [2022-12-06 03:24:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 03:24:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:26,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128376451] [2022-12-06 03:24:26,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128376451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:26,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777581648] [2022-12-06 03:24:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:26,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:26,442 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 03:24:26,444 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 03:24:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:26,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 03:24:26,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 03:24:26,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:26,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777581648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:26,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 03:24:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131952911] [2022-12-06 03:24:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:26,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:24:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:24:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 03:24:26,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:24:26,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 733 transitions, 18180 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:26,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:26,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:24:26,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:27,112 INFO L130 PetriNetUnfolder]: 1464/2876 cut-off events. [2022-12-06 03:24:27,112 INFO L131 PetriNetUnfolder]: For 523/523 co-relation queries the response was YES. [2022-12-06 03:24:27,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37801 conditions, 2876 events. 1464/2876 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19798 event pairs, 56 based on Foata normal form. 0/2063 useless extension candidates. Maximal degree in co-relation 12516. Up to 2850 conditions per place. [2022-12-06 03:24:27,124 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 304 selfloop transitions, 38 changer transitions 499/841 dead transitions. [2022-12-06 03:24:27,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 841 transitions, 22556 flow [2022-12-06 03:24:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:24:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:24:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 03:24:27,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 03:24:27,125 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 75 predicate places. [2022-12-06 03:24:27,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:27,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 841 transitions, 22556 flow [2022-12-06 03:24:27,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 841 transitions, 22556 flow [2022-12-06 03:24:27,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:27,153 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:27,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 03:24:27,155 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 841 transitions, 22556 flow [2022-12-06 03:24:27,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:27,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:27,155 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:27,166 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 03:24:27,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:27,361 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1579856478, now seen corresponding path program 2 times [2022-12-06 03:24:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:27,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834018608] [2022-12-06 03:24:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:27,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:27,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834018608] [2022-12-06 03:24:27,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834018608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:27,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766285542] [2022-12-06 03:24:27,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:27,551 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 03:24:27,574 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 03:24:27,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:27,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:27,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 03:24:27,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 03:24:27,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:27,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766285542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:27,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:27,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 03:24:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654674697] [2022-12-06 03:24:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:27,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:24:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:24:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 03:24:27,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:24:27,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 841 transitions, 22556 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 03:24:27,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:27,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:24:27,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:28,371 INFO L130 PetriNetUnfolder]: 1420/2807 cut-off events. [2022-12-06 03:24:28,372 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-06 03:24:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39706 conditions, 2807 events. 1420/2807 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19292 event pairs, 56 based on Foata normal form. 0/2026 useless extension candidates. Maximal degree in co-relation 13476. Up to 2781 conditions per place. [2022-12-06 03:24:28,384 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 299 selfloop transitions, 33 changer transitions 491/823 dead transitions. [2022-12-06 03:24:28,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 823 transitions, 23722 flow [2022-12-06 03:24:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:24:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:24:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 03:24:28,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2022-12-06 03:24:28,385 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 80 predicate places. [2022-12-06 03:24:28,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:28,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 823 transitions, 23722 flow [2022-12-06 03:24:28,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 823 transitions, 23722 flow [2022-12-06 03:24:28,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:28,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:28,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 03:24:28,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 823 transitions, 23722 flow [2022-12-06 03:24:28,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 03:24:28,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:28,411 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:28,433 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 03:24:28,616 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,SelfDestructingSolverStorable12 [2022-12-06 03:24:28,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -152436278, now seen corresponding path program 3 times [2022-12-06 03:24:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044970013] [2022-12-06 03:24:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:24:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:28,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044970013] [2022-12-06 03:24:28,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044970013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:28,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032856995] [2022-12-06 03:24:28,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:24:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:28,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:28,712 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 03:24:28,763 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 03:24:28,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:24:28,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:28,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 03:24:28,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:28,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:28,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 03:24:28,855 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 03:24:28,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:28,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 03:24:29,075 INFO L321 Elim1Store]: treesize reduction 32, result has 8.6 percent of original size [2022-12-06 03:24:29,077 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 30 treesize of output 13 [2022-12-06 03:24:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:24:29,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:29,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((~size~0 Int) (v_ArrVal_413 (Array Int Int)) (~front~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base)) (.cse1 (* ~front~0 4))) (or (not (= 5 (select .cse0 (+ (* ~size~0 4) c_~queue~0.offset .cse1)))) (not (< (+ ~size~0 ~front~0) c_~n~0)) (= (select .cse0 (+ c_~queue~0.offset .cse1)) 5) (< ~size~0 0) (< ~front~0 0)))) is different from false [2022-12-06 03:24:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 03:24:29,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032856995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:29,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:29,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-06 03:24:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319436909] [2022-12-06 03:24:29,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:24:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:24:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2022-12-06 03:24:29,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:24:29,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 823 transitions, 23722 flow. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 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 03:24:29,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:29,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:24:29,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:32,245 INFO L130 PetriNetUnfolder]: 1069/2129 cut-off events. [2022-12-06 03:24:32,245 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2022-12-06 03:24:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32268 conditions, 2129 events. 1069/2129 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14027 event pairs, 52 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 14436. Up to 2103 conditions per place. [2022-12-06 03:24:32,253 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 226 selfloop transitions, 11 changer transitions 391/628 dead transitions. [2022-12-06 03:24:32,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 628 transitions, 19368 flow [2022-12-06 03:24:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:24:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:24:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-12-06 03:24:32,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 03:24:32,255 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 89 predicate places. [2022-12-06 03:24:32,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:32,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 628 transitions, 19368 flow [2022-12-06 03:24:32,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 628 transitions, 19368 flow [2022-12-06 03:24:32,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:34,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:24:34,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2410 [2022-12-06 03:24:34,665 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 627 transitions, 19338 flow [2022-12-06 03:24:34,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 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 03:24:34,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:34,665 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:34,691 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 03:24:34,874 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,SelfDestructingSolverStorable13 [2022-12-06 03:24:34,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2000034542, now seen corresponding path program 1 times [2022-12-06 03:24:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:34,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278948663] [2022-12-06 03:24:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:35,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278948663] [2022-12-06 03:24:35,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278948663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:35,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259968731] [2022-12-06 03:24:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:35,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:35,319 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 03:24:35,321 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 03:24:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:35,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:24:35,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:35,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:24:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:35,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:35,521 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-06 03:24:35,521 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 28 treesize of output 13 [2022-12-06 03:24:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:35,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259968731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:35,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:35,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-06 03:24:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369770880] [2022-12-06 03:24:35,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:35,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:24:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:24:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:24:35,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:35,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 627 transitions, 19338 flow. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:35,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:35,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:35,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:36,770 INFO L130 PetriNetUnfolder]: 1327/2593 cut-off events. [2022-12-06 03:24:36,770 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2022-12-06 03:24:36,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41874 conditions, 2593 events. 1327/2593 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17468 event pairs, 56 based on Foata normal form. 7/1859 useless extension candidates. Maximal degree in co-relation 20584. Up to 2567 conditions per place. [2022-12-06 03:24:36,781 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 197 selfloop transitions, 94 changer transitions 462/753 dead transitions. [2022-12-06 03:24:36,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 753 transitions, 24723 flow [2022-12-06 03:24:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:24:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:24:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 267 transitions. [2022-12-06 03:24:36,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533106960950764 [2022-12-06 03:24:36,783 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 118 predicate places. [2022-12-06 03:24:36,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:36,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 753 transitions, 24723 flow [2022-12-06 03:24:36,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 753 transitions, 24723 flow [2022-12-06 03:24:36,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:36,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:36,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 03:24:36,807 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 753 transitions, 24723 flow [2022-12-06 03:24:36,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:36,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:36,808 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:36,830 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 03:24:37,012 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,SelfDestructingSolverStorable14 [2022-12-06 03:24:37,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 475647122, now seen corresponding path program 2 times [2022-12-06 03:24:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:37,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566611088] [2022-12-06 03:24:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566611088] [2022-12-06 03:24:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566611088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153685726] [2022-12-06 03:24:37,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:24:37,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:37,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:37,402 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 03:24:37,406 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 03:24:37,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:24:37,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:37,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 03:24:37,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:37,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:37,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:24:37,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:24:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:37,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:37,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:24:37,675 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 47 treesize of output 37 [2022-12-06 03:24:37,677 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 10 treesize of output 3 [2022-12-06 03:24:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:37,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153685726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:37,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:37,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 03:24:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843982268] [2022-12-06 03:24:37,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:37,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:24:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:37,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:24:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:24:37,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:37,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 753 transitions, 24723 flow. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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 03:24:37,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:37,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:37,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:39,507 INFO L130 PetriNetUnfolder]: 2313/4419 cut-off events. [2022-12-06 03:24:39,507 INFO L131 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2022-12-06 03:24:39,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75741 conditions, 4419 events. 2313/4419 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32222 event pairs, 79 based on Foata normal form. 1/3082 useless extension candidates. Maximal degree in co-relation 21868. Up to 4393 conditions per place. [2022-12-06 03:24:39,532 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 471 selfloop transitions, 104 changer transitions 692/1267 dead transitions. [2022-12-06 03:24:39,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 1267 transitions, 44113 flow [2022-12-06 03:24:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:24:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:24:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-06 03:24:39,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45964912280701753 [2022-12-06 03:24:39,534 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 132 predicate places. [2022-12-06 03:24:39,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:39,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 1267 transitions, 44113 flow [2022-12-06 03:24:39,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 1267 transitions, 44113 flow [2022-12-06 03:24:39,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:39,601 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:39,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 03:24:39,601 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 1267 transitions, 44113 flow [2022-12-06 03:24:39,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 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 03:24:39,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:39,602 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:39,625 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 03:24:39,808 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,SelfDestructingSolverStorable15 [2022-12-06 03:24:39,808 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1155433352, now seen corresponding path program 1 times [2022-12-06 03:24:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:39,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903715662] [2022-12-06 03:24:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:40,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903715662] [2022-12-06 03:24:40,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903715662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:40,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804329117] [2022-12-06 03:24:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:40,327 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 03:24:40,328 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 03:24:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:40,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-06 03:24:40,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:40,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:24:40,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:24:40,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:24:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:40,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:40,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:24:40,696 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 47 treesize of output 37 [2022-12-06 03:24:40,702 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 10 treesize of output 3 [2022-12-06 03:24:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804329117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:40,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:40,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-06 03:24:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26846379] [2022-12-06 03:24:40,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 03:24:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 03:24:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=627, Unknown=1, NotChecked=0, Total=702 [2022-12-06 03:24:40,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:40,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 1267 transitions, 44113 flow. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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 03:24:40,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:40,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:40,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:41,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (* c_~front~0 4))) (and (forall ((v_ArrVal_535 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_535) c_~queue~0.base) (+ c_~queue~0.offset .cse0 8)) 5)) (= (select .cse1 (+ .cse0 4)) 5) (= (select .cse1 (+ c_~queue~0.offset .cse0)) 5) (= c_~queue~0.offset 0) (= 5 c_~x~0))) is different from false [2022-12-06 03:24:43,637 INFO L130 PetriNetUnfolder]: 3256/6212 cut-off events. [2022-12-06 03:24:43,638 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2022-12-06 03:24:43,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112657 conditions, 6212 events. 3256/6212 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47499 event pairs, 128 based on Foata normal form. 1/4270 useless extension candidates. Maximal degree in co-relation 34168. Up to 6186 conditions per place. [2022-12-06 03:24:43,666 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 630 selfloop transitions, 332 changer transitions 953/1915 dead transitions. [2022-12-06 03:24:43,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1915 transitions, 70425 flow [2022-12-06 03:24:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:24:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:24:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 206 transitions. [2022-12-06 03:24:43,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41700404858299595 [2022-12-06 03:24:43,668 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2022-12-06 03:24:43,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:43,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1915 transitions, 70425 flow [2022-12-06 03:24:43,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 1915 transitions, 70425 flow [2022-12-06 03:24:43,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:43,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:43,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 03:24:43,747 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 1915 transitions, 70425 flow [2022-12-06 03:24:43,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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 03:24:43,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:43,747 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:43,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 03:24:43,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:43,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1870004906, now seen corresponding path program 3 times [2022-12-06 03:24:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:43,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473990888] [2022-12-06 03:24:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:44,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473990888] [2022-12-06 03:24:44,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473990888] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:44,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632489336] [2022-12-06 03:24:44,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:24:44,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:44,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:44,028 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 03:24:44,030 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 03:24:44,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:24:44,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:44,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:24:44,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:44,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632489336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:44,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:44,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-12-06 03:24:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112201411] [2022-12-06 03:24:44,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:44,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:24:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:24:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:24:44,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:44,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 1915 transitions, 70425 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 03:24:44,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:44,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:44,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:48,934 INFO L130 PetriNetUnfolder]: 5398/10266 cut-off events. [2022-12-06 03:24:48,934 INFO L131 PetriNetUnfolder]: For 1808/1808 co-relation queries the response was YES. [2022-12-06 03:24:48,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196396 conditions, 10266 events. 5398/10266 cut-off events. For 1808/1808 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 84787 event pairs, 150 based on Foata normal form. 0/6959 useless extension candidates. Maximal degree in co-relation 62376. Up to 10240 conditions per place. [2022-12-06 03:24:48,982 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 1079 selfloop transitions, 468 changer transitions 1631/3178 dead transitions. [2022-12-06 03:24:48,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 3178 transitions, 123233 flow [2022-12-06 03:24:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:24:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:24:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 03:24:48,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 03:24:48,983 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 162 predicate places. [2022-12-06 03:24:48,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:48,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 3178 transitions, 123233 flow [2022-12-06 03:24:49,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 3178 transitions, 123233 flow [2022-12-06 03:24:49,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:49,108 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:49,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 03:24:49,109 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 3178 transitions, 123233 flow [2022-12-06 03:24:49,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 03:24:49,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:49,109 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:49,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 03:24:49,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 03:24:49,314 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1584096155, now seen corresponding path program 4 times [2022-12-06 03:24:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:49,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930227046] [2022-12-06 03:24:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 03:24:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930227046] [2022-12-06 03:24:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930227046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:49,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998131121] [2022-12-06 03:24:49,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:24:49,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:49,398 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 03:24:49,400 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 03:24:49,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:24:49,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:49,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 03:24:49,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-06 03:24:49,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:49,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998131121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:49,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:49,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 03:24:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553961679] [2022-12-06 03:24:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:49,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:24:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:24:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 03:24:49,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:49,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 3178 transitions, 123233 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 03:24:49,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:49,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:49,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:56,297 INFO L130 PetriNetUnfolder]: 4533/8795 cut-off events. [2022-12-06 03:24:56,297 INFO L131 PetriNetUnfolder]: For 1568/1568 co-relation queries the response was YES. [2022-12-06 03:24:56,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177077 conditions, 8795 events. 4533/8795 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 72064 event pairs, 136 based on Foata normal form. 0/6112 useless extension candidates. Maximal degree in co-relation 65656. Up to 8769 conditions per place. [2022-12-06 03:24:56,332 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 1043 selfloop transitions, 191 changer transitions 1482/2716 dead transitions. [2022-12-06 03:24:56,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 2716 transitions, 110785 flow [2022-12-06 03:24:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:24:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:24:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 03:24:56,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 03:24:56,333 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 167 predicate places. [2022-12-06 03:24:56,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:56,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 2716 transitions, 110785 flow [2022-12-06 03:24:56,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 2716 transitions, 110785 flow [2022-12-06 03:24:56,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:56,424 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:56,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 03:24:56,424 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 2716 transitions, 110785 flow [2022-12-06 03:24:56,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 03:24:56,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:56,425 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:56,432 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 03:24:56,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:56,630 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 148707301, now seen corresponding path program 5 times [2022-12-06 03:24:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:56,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33651214] [2022-12-06 03:24:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 03:24:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:56,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33651214] [2022-12-06 03:24:56,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33651214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:56,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608456863] [2022-12-06 03:24:56,726 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:24:56,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:56,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:56,752 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:56,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:24:56,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:24:56,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:56,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 03:24:56,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 03:24:56,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:24:56,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608456863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:24:56,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:24:56,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-12-06 03:24:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073651997] [2022-12-06 03:24:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:24:56,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:24:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:24:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-06 03:24:56,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:24:56,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 2716 transitions, 110785 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:56,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:56,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:24:56,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:02,309 INFO L130 PetriNetUnfolder]: 3467/6771 cut-off events. [2022-12-06 03:25:02,309 INFO L131 PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES. [2022-12-06 03:25:02,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143133 conditions, 6771 events. 3467/6771 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 53269 event pairs, 114 based on Foata normal form. 0/4751 useless extension candidates. Maximal degree in co-relation 68936. Up to 6745 conditions per place. [2022-12-06 03:25:02,337 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 800 selfloop transitions, 0 changer transitions 1273/2073 dead transitions. [2022-12-06 03:25:02,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2073 transitions, 88734 flow [2022-12-06 03:25:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:25:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:25:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 03:25:02,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-06 03:25:02,338 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 169 predicate places. [2022-12-06 03:25:02,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:02,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 2073 transitions, 88734 flow [2022-12-06 03:25:02,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 2073 transitions, 88734 flow [2022-12-06 03:25:02,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:02,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:02,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 03:25:02,410 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 2073 transitions, 88734 flow [2022-12-06 03:25:02,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:25:02,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:02,411 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:02,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:25:02,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:02,613 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1778823681, now seen corresponding path program 2 times [2022-12-06 03:25:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:02,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949171047] [2022-12-06 03:25:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:02,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949171047] [2022-12-06 03:25:02,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949171047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:02,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058528144] [2022-12-06 03:25:02,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:25:02,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:02,992 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:02,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:25:03,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:25:03,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:03,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:25:03,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:03,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:25:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:03,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:03,352 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-06 03:25:03,352 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 28 treesize of output 13 [2022-12-06 03:25:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058528144] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:03,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:03,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-06 03:25:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689418390] [2022-12-06 03:25:03,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 03:25:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 03:25:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-12-06 03:25:03,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:25:03,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 2073 transitions, 88734 flow. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 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 03:25:03,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:03,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:25:03,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:10,964 INFO L130 PetriNetUnfolder]: 4611/8894 cut-off events. [2022-12-06 03:25:10,964 INFO L131 PetriNetUnfolder]: For 1649/1649 co-relation queries the response was YES. [2022-12-06 03:25:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196858 conditions, 8894 events. 4611/8894 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 71760 event pairs, 122 based on Foata normal form. 16/6157 useless extension candidates. Maximal degree in co-relation 103196. Up to 8868 conditions per place. [2022-12-06 03:25:11,003 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 683 selfloop transitions, 397 changer transitions 1627/2707 dead transitions. [2022-12-06 03:25:11,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2707 transitions, 121268 flow [2022-12-06 03:25:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-06 03:25:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-12-06 03:25:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 558 transitions. [2022-12-06 03:25:11,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4518218623481781 [2022-12-06 03:25:11,006 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 233 predicate places. [2022-12-06 03:25:11,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:11,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 2707 transitions, 121268 flow [2022-12-06 03:25:11,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 2707 transitions, 121268 flow [2022-12-06 03:25:11,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:25:11,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:25:11,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 03:25:11,112 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 2707 transitions, 121268 flow [2022-12-06 03:25:11,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 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 03:25:11,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:25:11,113 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:25:11,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 03:25:11,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:11,314 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:25:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:25:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 416091899, now seen corresponding path program 3 times [2022-12-06 03:25:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:25:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330738471] [2022-12-06 03:25:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:25:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:25:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:25:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:25:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330738471] [2022-12-06 03:25:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330738471] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:25:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257560974] [2022-12-06 03:25:12,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:25:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:25:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:25:12,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:25:12,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:25:12,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:25:12,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:25:12,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 03:25:12,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:25:12,192 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 40 treesize of output 49 [2022-12-06 03:25:12,228 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 03:25:12,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:25:12,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-12-06 03:25:12,688 INFO L321 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-12-06 03:25:12,688 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 26 treesize of output 10 [2022-12-06 03:25:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:12,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:25:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:25:19,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257560974] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:25:19,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:25:19,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-06 03:25:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452293242] [2022-12-06 03:25:19,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:25:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 03:25:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:25:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 03:25:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=914, Unknown=6, NotChecked=0, Total=1056 [2022-12-06 03:25:19,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:25:19,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 2707 transitions, 121268 flow. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 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 03:25:19,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:25:19,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:25:19,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:25:59,011 INFO L130 PetriNetUnfolder]: 12986/24865 cut-off events. [2022-12-06 03:25:59,011 INFO L131 PetriNetUnfolder]: For 4477/4477 co-relation queries the response was YES. [2022-12-06 03:25:59,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574999 conditions, 24865 events. 12986/24865 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 231085 event pairs, 224 based on Foata normal form. 2/16957 useless extension candidates. Maximal degree in co-relation 243768. Up to 24839 conditions per place. [2022-12-06 03:25:59,116 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1058 selfloop transitions, 18 changer transitions 6505/7581 dead transitions. [2022-12-06 03:25:59,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 7581 transitions, 354669 flow [2022-12-06 03:25:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-06 03:25:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-06 03:25:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 610 transitions. [2022-12-06 03:25:59,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4280701754385965 [2022-12-06 03:25:59,122 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 307 predicate places. [2022-12-06 03:25:59,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:25:59,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 326 places, 7581 transitions, 354669 flow [2022-12-06 03:25:59,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 326 places, 7581 transitions, 354669 flow [2022-12-06 03:25:59,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:05,718 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 03:26:05,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6597 [2022-12-06 03:26:05,719 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 7579 transitions, 354577 flow [2022-12-06 03:26:05,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 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 03:26:05,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:05,719 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:05,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:26:05,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:05,925 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 293972314, now seen corresponding path program 1 times [2022-12-06 03:26:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:05,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923689546] [2022-12-06 03:26:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923689546] [2022-12-06 03:26:06,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923689546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991752596] [2022-12-06 03:26:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:06,496 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:06,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:26:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:06,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:26:06,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:06,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:26:06,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:26:06,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:26:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:06,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:06,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:26:06,871 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 47 treesize of output 37 [2022-12-06 03:26:06,875 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 10 treesize of output 3 [2022-12-06 03:26:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:06,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991752596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:06,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-06 03:26:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698141208] [2022-12-06 03:26:06,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:26:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:26:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=576, Unknown=2, NotChecked=0, Total=650 [2022-12-06 03:26:06,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:26:06,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 7579 transitions, 354577 flow. Second operand has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:06,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:06,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:26:06,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:28:02,009 INFO L130 PetriNetUnfolder]: 16716/31844 cut-off events. [2022-12-06 03:28:02,009 INFO L131 PetriNetUnfolder]: For 5747/5747 co-relation queries the response was YES. [2022-12-06 03:28:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768209 conditions, 31844 events. 16716/31844 cut-off events. For 5747/5747 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 307360 event pairs, 287 based on Foata normal form. 1/21586 useless extension candidates. Maximal degree in co-relation 255228. Up to 31818 conditions per place. [2022-12-06 03:28:02,136 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 1730 selfloop transitions, 411 changer transitions 7572/9713 dead transitions. [2022-12-06 03:28:02,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 9713 transitions, 473805 flow [2022-12-06 03:28:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:28:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:28:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 167 transitions. [2022-12-06 03:28:02,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41854636591478694 [2022-12-06 03:28:02,139 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 323 predicate places. [2022-12-06 03:28:02,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:28:02,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 9713 transitions, 473805 flow [2022-12-06 03:28:02,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 9713 transitions, 473805 flow [2022-12-06 03:28:02,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:28:02,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:28:02,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 459 [2022-12-06 03:28:02,598 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 9713 transitions, 473805 flow [2022-12-06 03:28:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:28:02,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:28:02,598 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:28:02,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 03:28:02,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-06 03:28:02,804 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:28:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:28:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1628029226, now seen corresponding path program 1 times [2022-12-06 03:28:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:28:02,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365366726] [2022-12-06 03:28:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:28:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:28:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:28:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:28:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365366726] [2022-12-06 03:28:03,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365366726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:28:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167855108] [2022-12-06 03:28:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:28:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:28:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:28:03,335 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:28:03,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:28:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:28:03,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 03:28:03,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:28:03,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:28:03,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:28:03,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:28:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:03,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:28:03,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_832) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 12)))) is different from false [2022-12-06 03:28:03,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:28:03,667 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 47 treesize of output 37 [2022-12-06 03:28:03,673 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 10 treesize of output 3 [2022-12-06 03:28:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-06 03:28:03,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167855108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:28:03,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:28:03,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-12-06 03:28:03,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229978724] [2022-12-06 03:28:03,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:28:03,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 03:28:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:28:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 03:28:03,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=681, Unknown=1, NotChecked=52, Total=812 [2022-12-06 03:28:03,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:28:03,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 9713 transitions, 473805 flow. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 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 03:28:03,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:28:03,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:28:03,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:30:41,658 INFO L130 PetriNetUnfolder]: 19228/35892 cut-off events. [2022-12-06 03:30:41,658 INFO L131 PetriNetUnfolder]: For 6558/6558 co-relation queries the response was YES. [2022-12-06 03:30:41,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901693 conditions, 35892 events. 19228/35892 cut-off events. For 6558/6558 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 344095 event pairs, 478 based on Foata normal form. 1/24163 useless extension candidates. Maximal degree in co-relation 310510. Up to 35866 conditions per place. [2022-12-06 03:30:41,807 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 1462 selfloop transitions, 1166 changer transitions 8360/10988 dead transitions. [2022-12-06 03:30:41,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 10988 transitions, 557677 flow [2022-12-06 03:30:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:30:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:30:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 182 transitions. [2022-12-06 03:30:41,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2022-12-06 03:30:41,812 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 343 predicate places. [2022-12-06 03:30:41,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:30:41,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 10988 transitions, 557677 flow [2022-12-06 03:30:42,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 10988 transitions, 557677 flow [2022-12-06 03:30:42,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:30:42,287 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:30:42,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 03:30:42,288 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 10988 transitions, 557677 flow [2022-12-06 03:30:42,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 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 03:30:42,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:30:42,288 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:30:42,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:30:42,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 03:30:42,494 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:30:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:30:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -183304328, now seen corresponding path program 2 times [2022-12-06 03:30:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:30:42,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829275308] [2022-12-06 03:30:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:30:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:30:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:30:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:42,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:30:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829275308] [2022-12-06 03:30:42,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829275308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:30:42,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425982654] [2022-12-06 03:30:42,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:30:42,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:30:42,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:30:42,572 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:30:42,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:30:42,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:30:42,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:30:42,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 03:30:42,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:30:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:42,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:30:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:30:42,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425982654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:30:42,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:30:42,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-12-06 03:30:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868105498] [2022-12-06 03:30:42,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:30:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:30:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:30:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:30:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:30:42,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:30:42,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 10988 transitions, 557677 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 03:30:42,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:30:42,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:30:42,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:35:10,332 INFO L130 PetriNetUnfolder]: 28525/54134 cut-off events. [2022-12-06 03:35:10,333 INFO L131 PetriNetUnfolder]: For 10038/10038 co-relation queries the response was YES. [2022-12-06 03:35:10,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414184 conditions, 54134 events. 28525/54134 cut-off events. For 10038/10038 co-relation queries the response was YES. Maximal size of possible extension queue 2981. Compared 560758 event pairs, 512 based on Foata normal form. 0/36486 useless extension candidates. Maximal degree in co-relation 444628. Up to 54108 conditions per place. [2022-12-06 03:35:10,577 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 2558 selfloop transitions, 1532 changer transitions 12842/16932 dead transitions. [2022-12-06 03:35:10,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 16932 transitions, 893430 flow [2022-12-06 03:35:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:35:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:35:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-06 03:35:10,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2022-12-06 03:35:10,579 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 349 predicate places. [2022-12-06 03:35:10,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:35:10,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 368 places, 16932 transitions, 893430 flow [2022-12-06 03:35:11,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 368 places, 16932 transitions, 893430 flow [2022-12-06 03:35:11,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:35:11,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:35:11,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1037 [2022-12-06 03:35:11,616 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 16932 transitions, 893430 flow [2022-12-06 03:35:11,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 03:35:11,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:35:11,617 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:35:11,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 03:35:11,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:35:11,817 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:35:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:35:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1257798701, now seen corresponding path program 3 times [2022-12-06 03:35:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:35:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784140003] [2022-12-06 03:35:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:35:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:35:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:35:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:35:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:35:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784140003] [2022-12-06 03:35:12,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784140003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:35:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506210427] [2022-12-06 03:35:12,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:35:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:35:12,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:35:12,258 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:35:12,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:35:12,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 03:35:12,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:35:12,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 03:35:12,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:35:12,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:35:12,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:35:12,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:35:12,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:35:12,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2022-12-06 03:35:12,882 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 03:35:12,915 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 03:35:13,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 03:35:13,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:35:13,144 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 17 treesize of output 10 [2022-12-06 03:35:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:35:13,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:35:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:35:13,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506210427] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:35:13,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:35:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-12-06 03:35:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956205255] [2022-12-06 03:35:13,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:35:13,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 03:35:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:35:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 03:35:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1029, Unknown=1, NotChecked=0, Total=1190 [2022-12-06 03:35:13,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:35:13,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 16932 transitions, 893430 flow. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 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 03:35:13,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:35:13,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:35:13,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:35:16,868 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 03:35:19,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:35:21,708 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 03:35:23,769 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 03:35:25,851 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 03:35:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:35:29,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:35:31,983 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 03:35:48,355 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 03:35:50,802 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 03:35:54,786 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 03:36:03,567 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 03:36:06,004 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 03:36:10,444 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 03:36:15,257 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 03:36:17,275 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 03:36:18,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:36:21,695 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 03:36:27,814 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 03:36:30,560 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 03:36:35,459 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 03:36:37,674 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 03:36:40,144 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 03:37:36,616 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 03:37:42,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 03:37:57,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 03:37:59,885 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 03:38:05,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 03:38:16,394 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 03:38:16,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:38:17,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:38:17,595 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 03:38:17,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-06 03:38:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-06 03:38:17,614 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:38:17,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 03:38:17,615 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 03:38:17,616 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:38:17,616 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:38:17,616 INFO L458 BasicCegarLoop]: Path program histogram: [5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-06 03:38:17,618 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:38:17,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:38:17,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:38:17 BasicIcfg [2022-12-06 03:38:17,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:38:17,620 INFO L158 Benchmark]: Toolchain (without parser) took 848657.55ms. Allocated memory was 178.3MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 154.9MB in the beginning and 837.6MB in the end (delta: -682.7MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.06ms. Allocated memory is still 178.3MB. Free memory was 154.5MB in the beginning and 142.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.66ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: Boogie Preprocessor took 39.66ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 139.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: RCFGBuilder took 592.64ms. Allocated memory is still 178.3MB. Free memory was 139.2MB in the beginning and 117.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 03:38:17,620 INFO L158 Benchmark]: TraceAbstraction took 847688.40ms. Allocated memory was 178.3MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 116.7MB in the beginning and 837.6MB in the end (delta: -720.9MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 03:38:17,621 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.13ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.06ms. Allocated memory is still 178.3MB. Free memory was 154.5MB in the beginning and 142.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.66ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.66ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 139.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 592.64ms. Allocated memory is still 178.3MB. Free memory was 139.2MB in the beginning and 117.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 847688.40ms. Allocated memory was 178.3MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 116.7MB in the beginning and 837.6MB in the end (delta: -720.9MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 94 PlacesBefore, 19 PlacesAfterwards, 96 TransitionsBefore, 15 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 200, independent conditional: 200, 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: 200, independent: 200, independent conditional: 0, independent unconditional: 200, 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: 200, independent: 200, independent conditional: 0, independent unconditional: 200, 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: 200, independent: 200, independent conditional: 0, independent unconditional: 200, 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: 200, independent: 200, independent conditional: 0, independent unconditional: 200, 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: 200, independent: 200, independent conditional: 0, independent unconditional: 200, 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: 200, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 335, Positive conditional cache size: 0, Positive unconditional cache size: 335, 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, 21 PlacesBefore, 21 PlacesAfterwards, 23 TransitionsBefore, 23 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, 23 PlacesBefore, 23 PlacesAfterwards, 32 TransitionsBefore, 32 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: 1.1s, 26 PlacesBefore, 25 PlacesAfterwards, 43 TransitionsBefore, 42 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, 29 PlacesBefore, 29 PlacesAfterwards, 59 TransitionsBefore, 59 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, 33 PlacesBefore, 33 PlacesAfterwards, 67 TransitionsBefore, 67 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, 36 PlacesBefore, 36 PlacesAfterwards, 133 TransitionsBefore, 133 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: 1.9s, 40 PlacesBefore, 39 PlacesAfterwards, 206 TransitionsBefore, 205 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, 42 PlacesBefore, 42 PlacesAfterwards, 173 TransitionsBefore, 173 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, 58 PlacesBefore, 58 PlacesAfterwards, 228 TransitionsBefore, 228 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, 254 TransitionsBefore, 254 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: 2.0s, 93 PlacesBefore, 92 PlacesAfterwards, 734 TransitionsBefore, 733 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, 94 PlacesBefore, 94 PlacesAfterwards, 841 TransitionsBefore, 841 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, 99 PlacesBefore, 99 PlacesAfterwards, 823 TransitionsBefore, 823 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: 2.4s, 108 PlacesBefore, 107 PlacesAfterwards, 628 TransitionsBefore, 627 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, 137 PlacesBefore, 137 PlacesAfterwards, 753 TransitionsBefore, 753 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, 151 PlacesBefore, 151 PlacesAfterwards, 1267 TransitionsBefore, 1267 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, 176 PlacesBefore, 176 PlacesAfterwards, 1915 TransitionsBefore, 1915 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, 181 PlacesBefore, 181 PlacesAfterwards, 3178 TransitionsBefore, 3178 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, 186 PlacesBefore, 186 PlacesAfterwards, 2716 TransitionsBefore, 2716 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, 188 PlacesBefore, 188 PlacesAfterwards, 2073 TransitionsBefore, 2073 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, 252 PlacesBefore, 252 PlacesAfterwards, 2707 TransitionsBefore, 2707 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: 6.3s, 326 PlacesBefore, 324 PlacesAfterwards, 7581 TransitionsBefore, 7579 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, 342 PlacesBefore, 342 PlacesAfterwards, 9713 TransitionsBefore, 9713 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, 362 PlacesBefore, 362 PlacesAfterwards, 10988 TransitionsBefore, 10988 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.1s, 368 PlacesBefore, 368 PlacesAfterwards, 16932 TransitionsBefore, 16932 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: 85]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 114 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 847.6s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 801.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 67 mSolverCounterUnknown, 7002 SdHoareTripleChecker+Valid, 82.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7002 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 80.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 244 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 893 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15706 IncrementalHoareTripleChecker+Invalid, 16910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 893 mSolverCounterUnsat, 0 mSDtfsCounter, 15706 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 478 SyntacticMatches, 29 SemanticMatches, 701 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12600 ImplicationChecksByTransitivity, 107.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=893430occurred in iteration=25, InterpolantAutomatonStates: 385, 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.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 843 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1076 ConstructedInterpolants, 76 QuantifiedInterpolants, 10728 SizeOfPredicates, 225 NumberOfNonLiveVariables, 5144 ConjunctsInSsa, 592 ConjunctsInUnsatCore, 66 InterpolantComputations, 9 PerfectInterpolantSequences, 296/839 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