/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:26:35,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:26:35,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:26:35,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:26:35,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:26:35,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:26:35,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:26:35,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:26:35,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:26:35,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:26:35,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:26:35,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:26:35,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:26:35,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:26:35,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:26:35,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:26:35,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:26:35,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:26:35,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:26:35,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:26:35,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:26:35,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:26:35,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:26:35,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:26:35,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:26:35,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:26:35,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:26:35,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:26:35,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:26:35,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:26:35,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:26:35,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:26:35,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:26:35,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:26:35,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:26:35,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:26:35,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:26:35,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:26:35,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:26:35,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:26:35,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:26:35,438 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-13 08:26:35,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:26:35,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:26:35,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:26:35,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:26:35,471 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:26:35,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:26:35,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:26:35,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:26:35,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:26:35,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:26:35,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:26:35,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:26:35,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:26:35,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:26:35,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:26:35,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:26:35,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:26:35,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:26:35,476 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:26:35,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:26:35,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:26:35,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:26:35,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:26:35,822 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:26:35,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 08:26:36,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:26:37,183 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:26:37,183 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 08:26:37,192 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb182ae9e/a2359f2476c94054b19e85eabb76e835/FLAG65b53208a [2022-12-13 08:26:37,530 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb182ae9e/a2359f2476c94054b19e85eabb76e835 [2022-12-13 08:26:37,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:26:37,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:26:37,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:26:37,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:26:37,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:26:37,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f038a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37, skipping insertion in model container [2022-12-13 08:26:37,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:26:37,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:26:37,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,723 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 08:26:37,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:26:37,740 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:26:37,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:26:37,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:26:37,783 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 08:26:37,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:26:37,808 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:26:37,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37 WrapperNode [2022-12-13 08:26:37,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:26:37,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:26:37,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:26:37,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:26:37,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,860 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-12-13 08:26:37,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:26:37,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:26:37,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:26:37,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:26:37,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,897 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:26:37,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:26:37,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:26:37,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:26:37,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (1/1) ... [2022-12-13 08:26:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:26:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:37,937 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-13 08:26:37,958 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-13 08:26:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:26:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:26:37,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:26:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:26:37,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:26:37,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 08:26:37,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 08:26:37,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:26:37,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:26:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:26:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:26:37,982 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:26:38,098 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:26:38,099 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:26:38,356 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:26:38,414 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:26:38,414 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 08:26:38,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:26:38 BoogieIcfgContainer [2022-12-13 08:26:38,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:26:38,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:26:38,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:26:38,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:26:38,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:26:37" (1/3) ... [2022-12-13 08:26:38,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8eae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:26:38, skipping insertion in model container [2022-12-13 08:26:38,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:26:37" (2/3) ... [2022-12-13 08:26:38,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8eae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:26:38, skipping insertion in model container [2022-12-13 08:26:38,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:26:38" (3/3) ... [2022-12-13 08:26:38,430 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 08:26:38,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:26:38,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:26:38,448 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:26:38,532 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 08:26:38,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 08:26:38,662 INFO L130 PetriNetUnfolder]: 10/120 cut-off events. [2022-12-13 08:26:38,663 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:26:38,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 10/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 08:26:38,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 08:26:38,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-12-13 08:26:38,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:38,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 08:26:38,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 240 flow [2022-12-13 08:26:38,757 INFO L130 PetriNetUnfolder]: 10/108 cut-off events. [2022-12-13 08:26:38,757 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:26:38,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 10/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 08:26:38,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 08:26:38,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 08:26:42,595 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 08:26:42,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:26:42,613 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;@24bbcfec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:26:42,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 08:26:42,620 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 08:26:42,620 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 08:26:42,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:42,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:42,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2052267608, now seen corresponding path program 1 times [2022-12-13 08:26:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233483629] [2022-12-13 08:26:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:43,081 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-13 08:26:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:43,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233483629] [2022-12-13 08:26:43,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233483629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:43,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 08:26:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075184881] [2022-12-13 08:26:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:26:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:26:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:26:43,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:43,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:43,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:43,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:43,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:43,258 INFO L130 PetriNetUnfolder]: 431/611 cut-off events. [2022-12-13 08:26:43,258 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 08:26:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 611 events. 431/611 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1712 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 928. Up to 405 conditions per place. [2022-12-13 08:26:43,263 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 39 selfloop transitions, 3 changer transitions 3/45 dead transitions. [2022-12-13 08:26:43,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 225 flow [2022-12-13 08:26:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:26:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:26:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 08:26:43,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 08:26:43,276 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 08:26:43,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 45 transitions, 225 flow [2022-12-13 08:26:43,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 42 transitions, 207 flow [2022-12-13 08:26:43,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:43,284 INFO L89 Accepts]: Start accepts. Operand has 36 places, 42 transitions, 207 flow [2022-12-13 08:26:43,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:43,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:43,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 42 transitions, 207 flow [2022-12-13 08:26:43,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 42 transitions, 207 flow [2022-12-13 08:26:43,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:43,295 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:43,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 08:26:43,297 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 42 transitions, 207 flow [2022-12-13 08:26:43,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:43,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:43,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:43,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:26:43,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1346749667, now seen corresponding path program 1 times [2022-12-13 08:26:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:43,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233457796] [2022-12-13 08:26:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:43,551 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-13 08:26:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:43,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233457796] [2022-12-13 08:26:43,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233457796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:43,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:43,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:26:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981467152] [2022-12-13 08:26:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:43,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:26:43,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:43,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 42 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:43,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:43,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:43,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:43,728 INFO L130 PetriNetUnfolder]: 485/702 cut-off events. [2022-12-13 08:26:43,728 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 08:26:43,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 702 events. 485/702 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2163 event pairs, 45 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 1924. Up to 503 conditions per place. [2022-12-13 08:26:43,735 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 56 selfloop transitions, 4 changer transitions 11/71 dead transitions. [2022-12-13 08:26:43,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 71 transitions, 489 flow [2022-12-13 08:26:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 08:26:43,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 08:26:43,738 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 08:26:43,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 71 transitions, 489 flow [2022-12-13 08:26:43,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 60 transitions, 411 flow [2022-12-13 08:26:43,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:43,745 INFO L89 Accepts]: Start accepts. Operand has 39 places, 60 transitions, 411 flow [2022-12-13 08:26:43,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:43,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:43,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 60 transitions, 411 flow [2022-12-13 08:26:43,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 60 transitions, 411 flow [2022-12-13 08:26:43,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:43,749 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:43,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:26:43,750 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 60 transitions, 411 flow [2022-12-13 08:26:43,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:43,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:43,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:43,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:26:43,751 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash -38283032, now seen corresponding path program 1 times [2022-12-13 08:26:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:43,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816585765] [2022-12-13 08:26:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:43,889 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-13 08:26:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:43,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816585765] [2022-12-13 08:26:43,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816585765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:43,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:43,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:26:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119468760] [2022-12-13 08:26:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:43,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:26:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:26:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:26:43,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:43,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 60 transitions, 411 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-13 08:26:43,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:43,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:43,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:44,081 INFO L130 PetriNetUnfolder]: 587/828 cut-off events. [2022-12-13 08:26:44,081 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 08:26:44,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 828 events. 587/828 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2441 event pairs, 81 based on Foata normal form. 8/556 useless extension candidates. Maximal degree in co-relation 3016. Up to 771 conditions per place. [2022-12-13 08:26:44,088 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 82 selfloop transitions, 8 changer transitions 4/94 dead transitions. [2022-12-13 08:26:44,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 94 transitions, 821 flow [2022-12-13 08:26:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 08:26:44,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 08:26:44,092 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-13 08:26:44,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 94 transitions, 821 flow [2022-12-13 08:26:44,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 90 transitions, 789 flow [2022-12-13 08:26:44,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:44,105 INFO L89 Accepts]: Start accepts. Operand has 42 places, 90 transitions, 789 flow [2022-12-13 08:26:44,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:44,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:44,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 90 transitions, 789 flow [2022-12-13 08:26:44,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 90 transitions, 789 flow [2022-12-13 08:26:44,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:44,114 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:44,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 08:26:44,115 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 90 transitions, 789 flow [2022-12-13 08:26:44,116 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-13 08:26:44,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:44,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:44,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:26:44,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -749334116, now seen corresponding path program 2 times [2022-12-13 08:26:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:44,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777345442] [2022-12-13 08:26:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:44,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777345442] [2022-12-13 08:26:44,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777345442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753882124] [2022-12-13 08:26:44,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:26:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:44,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:44,293 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-13 08:26:44,302 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-13 08:26:44,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:26:44,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:44,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 08:26:44,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:44,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:44,559 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-13 08:26:44,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753882124] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:44,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:26:44,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2022-12-13 08:26:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867523903] [2022-12-13 08:26:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:44,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:44,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 08:26:44,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:44,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 90 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:44,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:44,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:44,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:44,758 INFO L130 PetriNetUnfolder]: 917/1298 cut-off events. [2022-12-13 08:26:44,759 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 08:26:44,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6666 conditions, 1298 events. 917/1298 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4462 event pairs, 41 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 5774. Up to 1253 conditions per place. [2022-12-13 08:26:44,770 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 126 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2022-12-13 08:26:44,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 08:26:44,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.66 [2022-12-13 08:26:44,774 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-13 08:26:44,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:44,793 INFO L89 Accepts]: Start accepts. Operand has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:44,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:44,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:44,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:44,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 08:26:44,803 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 137 transitions, 1478 flow [2022-12-13 08:26:44,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:44,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:44,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:44,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 08:26:45,012 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-13 08:26:45,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1686738454, now seen corresponding path program 3 times [2022-12-13 08:26:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:45,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567343386] [2022-12-13 08:26:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:45,182 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-13 08:26:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567343386] [2022-12-13 08:26:45,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567343386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:45,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:45,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:26:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402951805] [2022-12-13 08:26:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:45,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:45,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:45,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:26:45,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:45,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 137 transitions, 1478 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:45,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:45,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:45,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:45,543 INFO L130 PetriNetUnfolder]: 1733/2464 cut-off events. [2022-12-13 08:26:45,543 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-12-13 08:26:45,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15108 conditions, 2464 events. 1733/2464 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9834 event pairs, 18 based on Foata normal form. 10/1662 useless extension candidates. Maximal degree in co-relation 14080. Up to 2419 conditions per place. [2022-12-13 08:26:45,564 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 305 selfloop transitions, 29 changer transitions 5/339 dead transitions. [2022-12-13 08:26:45,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 339 transitions, 4305 flow [2022-12-13 08:26:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:26:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:26:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 08:26:45,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-13 08:26:45,569 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-13 08:26:45,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 339 transitions, 4305 flow [2022-12-13 08:26:45,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 334 transitions, 4242 flow [2022-12-13 08:26:45,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:45,607 INFO L89 Accepts]: Start accepts. Operand has 49 places, 334 transitions, 4242 flow [2022-12-13 08:26:45,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:45,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:45,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 334 transitions, 4242 flow [2022-12-13 08:26:45,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 334 transitions, 4242 flow [2022-12-13 08:26:45,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:45,620 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:45,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 08:26:45,624 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 334 transitions, 4242 flow [2022-12-13 08:26:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:45,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:45,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:26:45,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1949285127, now seen corresponding path program 2 times [2022-12-13 08:26:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:45,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117718098] [2022-12-13 08:26:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:45,751 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-13 08:26:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117718098] [2022-12-13 08:26:45,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117718098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:45,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:45,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:26:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420106834] [2022-12-13 08:26:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:45,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:26:45,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:45,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 334 transitions, 4242 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:45,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:45,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:45,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:46,136 INFO L130 PetriNetUnfolder]: 1700/2427 cut-off events. [2022-12-13 08:26:46,136 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-13 08:26:46,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17312 conditions, 2427 events. 1700/2427 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9698 event pairs, 46 based on Foata normal form. 26/1645 useless extension candidates. Maximal degree in co-relation 16123. Up to 2393 conditions per place. [2022-12-13 08:26:46,153 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 308 selfloop transitions, 10 changer transitions 23/341 dead transitions. [2022-12-13 08:26:46,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 341 transitions, 5017 flow [2022-12-13 08:26:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:26:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:26:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 08:26:46,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.616 [2022-12-13 08:26:46,156 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-13 08:26:46,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 341 transitions, 5017 flow [2022-12-13 08:26:46,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 318 transitions, 4677 flow [2022-12-13 08:26:46,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:46,185 INFO L89 Accepts]: Start accepts. Operand has 53 places, 318 transitions, 4677 flow [2022-12-13 08:26:46,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:46,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:46,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 318 transitions, 4677 flow [2022-12-13 08:26:46,193 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 318 transitions, 4677 flow [2022-12-13 08:26:46,193 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:46,195 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:46,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 08:26:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 318 transitions, 4677 flow [2022-12-13 08:26:46,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:46,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:46,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:46,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:26:46,196 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2144818330, now seen corresponding path program 4 times [2022-12-13 08:26:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:46,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668088226] [2022-12-13 08:26:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668088226] [2022-12-13 08:26:46,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668088226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:46,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208338107] [2022-12-13 08:26:46,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:26:46,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:46,360 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-13 08:26:46,392 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-13 08:26:46,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:26:46,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:46,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 08:26:46,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:46,549 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-13 08:26:46,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:26:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208338107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:46,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:26:46,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 08:26:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792833634] [2022-12-13 08:26:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:26:46,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:46,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 318 transitions, 4677 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:46,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:46,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:46,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:46,931 INFO L130 PetriNetUnfolder]: 2062/2913 cut-off events. [2022-12-13 08:26:46,931 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-13 08:26:46,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23652 conditions, 2913 events. 2062/2913 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11833 event pairs, 36 based on Foata normal form. 0/2003 useless extension candidates. Maximal degree in co-relation 22222. Up to 2895 conditions per place. [2022-12-13 08:26:46,994 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 422 selfloop transitions, 22 changer transitions 0/444 dead transitions. [2022-12-13 08:26:46,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 08:26:46,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-13 08:26:46,997 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-13 08:26:46,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:47,035 INFO L89 Accepts]: Start accepts. Operand has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:47,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:47,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:47,047 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:47,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 08:26:47,048 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 444 transitions, 7392 flow [2022-12-13 08:26:47,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:47,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:47,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:47,055 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-13 08:26:47,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 08:26:47,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash 25076559, now seen corresponding path program 3 times [2022-12-13 08:26:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786896559] [2022-12-13 08:26:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786896559] [2022-12-13 08:26:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786896559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028976080] [2022-12-13 08:26:47,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:26:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:47,408 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-13 08:26:47,475 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-13 08:26:47,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:26:47,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:47,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 08:26:47,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:47,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:47,674 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-13 08:26:47,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028976080] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:47,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:26:47,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2022-12-13 08:26:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677558154] [2022-12-13 08:26:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:47,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:47,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:26:47,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:47,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 444 transitions, 7392 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:47,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:47,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:47,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:48,114 INFO L130 PetriNetUnfolder]: 1926/2709 cut-off events. [2022-12-13 08:26:48,114 INFO L131 PetriNetUnfolder]: For 439/439 co-relation queries the response was YES. [2022-12-13 08:26:48,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24680 conditions, 2709 events. 1926/2709 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10688 event pairs, 0 based on Foata normal form. 32/1883 useless extension candidates. Maximal degree in co-relation 23119. Up to 2691 conditions per place. [2022-12-13 08:26:48,132 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 462 selfloop transitions, 24 changer transitions 32/518 dead transitions. [2022-12-13 08:26:48,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 518 transitions, 9636 flow [2022-12-13 08:26:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 08:26:48,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 08:26:48,134 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-13 08:26:48,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 518 transitions, 9636 flow [2022-12-13 08:26:48,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 486 transitions, 9057 flow [2022-12-13 08:26:48,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:48,167 INFO L89 Accepts]: Start accepts. Operand has 58 places, 486 transitions, 9057 flow [2022-12-13 08:26:48,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:48,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:48,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 486 transitions, 9057 flow [2022-12-13 08:26:48,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 486 transitions, 9057 flow [2022-12-13 08:26:48,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:48,182 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:48,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 08:26:48,183 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 486 transitions, 9057 flow [2022-12-13 08:26:48,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-13 08:26:48,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:48,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:48,192 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-13 08:26:48,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:48,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1502298727, now seen corresponding path program 1 times [2022-12-13 08:26:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784860453] [2022-12-13 08:26:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:48,652 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-13 08:26:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:48,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784860453] [2022-12-13 08:26:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784860453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:48,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:26:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387472150] [2022-12-13 08:26:48,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:48,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:26:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:26:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:26:48,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:48,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 486 transitions, 9057 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-13 08:26:48,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:48,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:48,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:49,004 INFO L130 PetriNetUnfolder]: 1475/2040 cut-off events. [2022-12-13 08:26:49,005 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-13 08:26:49,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20624 conditions, 2040 events. 1475/2040 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7239 event pairs, 0 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 19472. Up to 2025 conditions per place. [2022-12-13 08:26:49,019 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 393 selfloop transitions, 27 changer transitions 0/420 dead transitions. [2022-12-13 08:26:49,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 08:26:49,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-13 08:26:49,022 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-13 08:26:49,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:49,047 INFO L89 Accepts]: Start accepts. Operand has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:49,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:49,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:49,063 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:49,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 08:26:49,064 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 420 transitions, 8643 flow [2022-12-13 08:26:49,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-13 08:26:49,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:49,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:49,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 08:26:49,064 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1330841770, now seen corresponding path program 1 times [2022-12-13 08:26:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898037514] [2022-12-13 08:26:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:49,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898037514] [2022-12-13 08:26:49,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898037514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:26:49,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:26:49,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 08:26:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357462764] [2022-12-13 08:26:49,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:26:49,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:26:49,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:49,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 420 transitions, 8643 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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-13 08:26:49,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:49,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:49,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:49,519 INFO L130 PetriNetUnfolder]: 1309/1794 cut-off events. [2022-12-13 08:26:49,520 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-12-13 08:26:49,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19931 conditions, 1794 events. 1309/1794 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6028 event pairs, 0 based on Foata normal form. 4/1284 useless extension candidates. Maximal degree in co-relation 18826. Up to 1779 conditions per place. [2022-12-13 08:26:49,538 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 327 selfloop transitions, 22 changer transitions 4/353 dead transitions. [2022-12-13 08:26:49,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 353 transitions, 7970 flow [2022-12-13 08:26:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:26:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:26:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 08:26:49,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.496 [2022-12-13 08:26:49,540 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-13 08:26:49,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 353 transitions, 7970 flow [2022-12-13 08:26:49,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 349 transitions, 7879 flow [2022-12-13 08:26:49,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:49,572 INFO L89 Accepts]: Start accepts. Operand has 62 places, 349 transitions, 7879 flow [2022-12-13 08:26:49,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:49,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:49,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 349 transitions, 7879 flow [2022-12-13 08:26:49,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 349 transitions, 7879 flow [2022-12-13 08:26:49,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:49,587 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:49,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 08:26:49,588 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 349 transitions, 7879 flow [2022-12-13 08:26:49,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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-13 08:26:49,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:49,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:49,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:26:49,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -20347669, now seen corresponding path program 1 times [2022-12-13 08:26:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796329806] [2022-12-13 08:26:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:49,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796329806] [2022-12-13 08:26:49,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796329806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:49,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655588537] [2022-12-13 08:26:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:49,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:49,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:49,758 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-13 08:26:49,769 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-13 08:26:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:49,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 08:26:49,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:49,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655588537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:26:49,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:26:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2022-12-13 08:26:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577758809] [2022-12-13 08:26:49,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:26:49,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:26:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:26:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:26:49,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:49,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 349 transitions, 7879 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:49,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:49,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:49,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:50,541 INFO L130 PetriNetUnfolder]: 3168/4480 cut-off events. [2022-12-13 08:26:50,541 INFO L131 PetriNetUnfolder]: For 683/683 co-relation queries the response was YES. [2022-12-13 08:26:50,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54241 conditions, 4480 events. 3168/4480 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19788 event pairs, 0 based on Foata normal form. 165/3445 useless extension candidates. Maximal degree in co-relation 51395. Up to 4472 conditions per place. [2022-12-13 08:26:50,574 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 614 selfloop transitions, 116 changer transitions 110/840 dead transitions. [2022-12-13 08:26:50,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 840 transitions, 20655 flow [2022-12-13 08:26:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:26:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:26:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 08:26:50,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71 [2022-12-13 08:26:50,576 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-13 08:26:50,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 840 transitions, 20655 flow [2022-12-13 08:26:50,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 730 transitions, 17919 flow [2022-12-13 08:26:50,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:50,639 INFO L89 Accepts]: Start accepts. Operand has 65 places, 730 transitions, 17919 flow [2022-12-13 08:26:50,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:50,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:50,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 730 transitions, 17919 flow [2022-12-13 08:26:50,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 730 transitions, 17919 flow [2022-12-13 08:26:50,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:50,667 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:50,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 08:26:50,668 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 730 transitions, 17919 flow [2022-12-13 08:26:50,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:50,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:50,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:50,675 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-13 08:26:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:50,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1811282133, now seen corresponding path program 2 times [2022-12-13 08:26:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79127297] [2022-12-13 08:26:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:51,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79127297] [2022-12-13 08:26:51,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79127297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967196633] [2022-12-13 08:26:51,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:26:51,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:51,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:51,054 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-13 08:26:51,057 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-13 08:26:51,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:26:51,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:51,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 08:26:51,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:51,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:26:51,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967196633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:26:51,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:26:51,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 08:26:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543744157] [2022-12-13 08:26:51,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:26:51,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:26:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:51,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:26:51,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:26:51,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:51,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 730 transitions, 17919 flow. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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-13 08:26:51,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:51,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:52,690 INFO L130 PetriNetUnfolder]: 5932/8370 cut-off events. [2022-12-13 08:26:52,691 INFO L131 PetriNetUnfolder]: For 1200/1200 co-relation queries the response was YES. [2022-12-13 08:26:52,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109669 conditions, 8370 events. 5932/8370 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 40938 event pairs, 0 based on Foata normal form. 165/6367 useless extension candidates. Maximal degree in co-relation 104486. Up to 8362 conditions per place. [2022-12-13 08:26:52,772 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 1074 selfloop transitions, 322 changer transitions 131/1527 dead transitions. [2022-12-13 08:26:52,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1527 transitions, 40560 flow [2022-12-13 08:26:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:26:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:26:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 08:26:52,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.752 [2022-12-13 08:26:52,775 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-13 08:26:52,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 1527 transitions, 40560 flow [2022-12-13 08:26:52,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 1396 transitions, 37046 flow [2022-12-13 08:26:52,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:52,938 INFO L89 Accepts]: Start accepts. Operand has 69 places, 1396 transitions, 37046 flow [2022-12-13 08:26:52,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:52,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:52,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 1396 transitions, 37046 flow [2022-12-13 08:26:52,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 1396 transitions, 37046 flow [2022-12-13 08:26:52,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:52,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:53,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 08:26:53,000 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 1396 transitions, 37046 flow [2022-12-13 08:26:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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-13 08:26:53,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:53,001 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:53,009 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-13 08:26:53,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 08:26:53,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -146503464, now seen corresponding path program 3 times [2022-12-13 08:26:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:53,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561695549] [2022-12-13 08:26:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561695549] [2022-12-13 08:26:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561695549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740136938] [2022-12-13 08:26:53,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:26:53,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:53,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:53,386 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-13 08:26:53,411 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-13 08:26:53,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:26:53,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:53,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 08:26:53,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:53,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:53,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740136938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:26:53,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:26:53,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 08:26:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366121354] [2022-12-13 08:26:53,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:26:53,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 08:26:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 08:26:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 08:26:53,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:53,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 1396 transitions, 37046 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:53,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:53,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:53,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:26:57,683 INFO L130 PetriNetUnfolder]: 11181/15764 cut-off events. [2022-12-13 08:26:57,683 INFO L131 PetriNetUnfolder]: For 2240/2240 co-relation queries the response was YES. [2022-12-13 08:26:57,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222237 conditions, 15764 events. 11181/15764 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 85516 event pairs, 0 based on Foata normal form. 262/11954 useless extension candidates. Maximal degree in co-relation 214965. Up to 15756 conditions per place. [2022-12-13 08:26:57,786 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 2687 selfloop transitions, 401 changer transitions 446/3534 dead transitions. [2022-12-13 08:26:57,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 3534 transitions, 100770 flow [2022-12-13 08:26:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:26:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:26:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 197 transitions. [2022-12-13 08:26:57,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4925 [2022-12-13 08:26:57,788 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2022-12-13 08:26:57,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 3534 transitions, 100770 flow [2022-12-13 08:26:57,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 3088 transitions, 87955 flow [2022-12-13 08:26:58,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:26:58,028 INFO L89 Accepts]: Start accepts. Operand has 83 places, 3088 transitions, 87955 flow [2022-12-13 08:26:58,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:26:58,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:26:58,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 3088 transitions, 87955 flow [2022-12-13 08:26:58,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 3088 transitions, 87955 flow [2022-12-13 08:26:58,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:26:58,187 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:26:58,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 08:26:58,188 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 3088 transitions, 87955 flow [2022-12-13 08:26:58,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:58,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:26:58,189 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:26:58,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 08:26:58,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:58,471 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:26:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:26:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1948020663, now seen corresponding path program 4 times [2022-12-13 08:26:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:26:58,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953389460] [2022-12-13 08:26:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:26:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:26:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:26:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:58,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:26:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953389460] [2022-12-13 08:26:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953389460] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:26:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809460880] [2022-12-13 08:26:58,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:26:58,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:26:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:26:58,647 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-13 08:26:58,649 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-13 08:26:58,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:26:58,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:26:58,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 08:26:58,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:26:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:58,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:26:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:26:58,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809460880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:26:58,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:26:58,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 08:26:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382130843] [2022-12-13 08:26:58,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:26:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:26:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:26:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:26:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:26:58,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:26:58,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 3088 transitions, 87955 flow. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:26:58,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:26:58,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:26:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:27:15,464 INFO L130 PetriNetUnfolder]: 25820/36509 cut-off events. [2022-12-13 08:27:15,464 INFO L131 PetriNetUnfolder]: For 5216/5216 co-relation queries the response was YES. [2022-12-13 08:27:15,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550555 conditions, 36509 events. 25820/36509 cut-off events. For 5216/5216 co-relation queries the response was YES. Maximal size of possible extension queue 1554. Compared 225720 event pairs, 0 based on Foata normal form. 1476/29523 useless extension candidates. Maximal degree in co-relation 535772. Up to 36501 conditions per place. [2022-12-13 08:27:15,944 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 6736 selfloop transitions, 1564 changer transitions 747/9047 dead transitions. [2022-12-13 08:27:15,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 9047 transitions, 275661 flow [2022-12-13 08:27:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:27:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:27:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 443 transitions. [2022-12-13 08:27:15,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4789189189189189 [2022-12-13 08:27:15,948 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 85 predicate places. [2022-12-13 08:27:15,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 9047 transitions, 275661 flow [2022-12-13 08:27:16,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 8300 transitions, 252705 flow [2022-12-13 08:27:16,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:27:16,590 INFO L89 Accepts]: Start accepts. Operand has 119 places, 8300 transitions, 252705 flow [2022-12-13 08:27:16,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:27:16,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:27:16,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 8300 transitions, 252705 flow [2022-12-13 08:27:16,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 8300 transitions, 252705 flow [2022-12-13 08:27:16,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:27:16,970 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:27:16,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-13 08:27:16,971 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 8300 transitions, 252705 flow [2022-12-13 08:27:16,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:27:16,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:27:16,972 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:27:16,983 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-13 08:27:17,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:27:17,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:27:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:27:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 122835702, now seen corresponding path program 5 times [2022-12-13 08:27:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:27:17,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108748846] [2022-12-13 08:27:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:27:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:27:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:27:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:27:17,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:27:17,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108748846] [2022-12-13 08:27:17,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108748846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:27:17,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066499443] [2022-12-13 08:27:17,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:27:17,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:27:17,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:27:17,340 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-13 08:27:17,343 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-13 08:27:17,442 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:27:17,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:27:17,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 08:27:17,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:27:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:27:17,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:27:17,647 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-13 08:27:17,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066499443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:27:17,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:27:17,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-13 08:27:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272898798] [2022-12-13 08:27:17,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:27:17,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 08:27:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:27:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 08:27:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-13 08:27:17,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:27:17,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 8300 transitions, 252705 flow. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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-13 08:27:17,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:27:17,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:27:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:29:58,425 INFO L130 PetriNetUnfolder]: 65991/94040 cut-off events. [2022-12-13 08:29:58,425 INFO L131 PetriNetUnfolder]: For 14113/14113 co-relation queries the response was YES. [2022-12-13 08:29:58,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512499 conditions, 94040 events. 65991/94040 cut-off events. For 14113/14113 co-relation queries the response was YES. Maximal size of possible extension queue 3849. Compared 665611 event pairs, 0 based on Foata normal form. 1248/73040 useless extension candidates. Maximal degree in co-relation 1468162. Up to 94032 conditions per place. [2022-12-13 08:29:59,295 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 21477 selfloop transitions, 4662 changer transitions 1142/27281 dead transitions. [2022-12-13 08:29:59,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 27281 transitions, 886300 flow [2022-12-13 08:29:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 08:29:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 08:29:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 369 transitions. [2022-12-13 08:29:59,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5089655172413793 [2022-12-13 08:29:59,298 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 113 predicate places. [2022-12-13 08:29:59,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 27281 transitions, 886300 flow [2022-12-13 08:30:00,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 26139 transitions, 848826 flow [2022-12-13 08:30:01,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:30:01,846 INFO L89 Accepts]: Start accepts. Operand has 147 places, 26139 transitions, 848826 flow [2022-12-13 08:30:02,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:30:02,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:30:02,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 26139 transitions, 848826 flow [2022-12-13 08:30:04,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 26139 transitions, 848826 flow [2022-12-13 08:30:04,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:30:05,233 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:30:05,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3388 [2022-12-13 08:30:05,234 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 26139 transitions, 848826 flow [2022-12-13 08:30:05,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 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-13 08:30:05,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:30:05,234 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:30:05,244 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-13 08:30:05,435 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,SelfDestructingSolverStorable14 [2022-12-13 08:30:05,435 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:30:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:30:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1557053175, now seen corresponding path program 6 times [2022-12-13 08:30:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:30:05,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920217755] [2022-12-13 08:30:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:30:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:30:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:30:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:30:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:30:05,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920217755] [2022-12-13 08:30:05,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920217755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:30:05,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666183204] [2022-12-13 08:30:05,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:30:05,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:30:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:30:05,578 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-13 08:30:05,580 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-13 08:30:05,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:30:05,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:30:05,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 08:30:05,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:30:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:30:05,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:30:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:30:05,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666183204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:30:05,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:30:05,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 08:30:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251946005] [2022-12-13 08:30:05,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:30:05,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 08:30:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:30:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 08:30:05,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-13 08:30:05,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 08:30:05,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 26139 transitions, 848826 flow. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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-13 08:30:05,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:30:05,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 08:30:05,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:40:13,120 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-13 08:40:13,140 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:40:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 08:40:13,392 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 08:40:13,401 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-13 08:40:13,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 08:40:13,604 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). [2022-12-13 08:40:13,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 08:40:13,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 08:40:13,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 08:40:13,607 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 08:40:13,607 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 1, 1, 1] [2022-12-13 08:40:13,613 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:40:13,614 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:40:13,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:40:13 BasicIcfg [2022-12-13 08:40:13,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:40:13,620 INFO L158 Benchmark]: Toolchain (without parser) took 816083.88ms. Allocated memory was 178.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 154.4MB in the beginning and 568.7MB in the end (delta: -414.3MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-13 08:40:13,621 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:40:13,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 178.3MB. Free memory was 154.1MB in the beginning and 142.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 08:40:13,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.57ms. Allocated memory is still 178.3MB. Free memory was 142.0MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:40:13,622 INFO L158 Benchmark]: Boogie Preprocessor took 38.51ms. Allocated memory is still 178.3MB. Free memory was 139.9MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:40:13,622 INFO L158 Benchmark]: RCFGBuilder took 516.02ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 118.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 08:40:13,622 INFO L158 Benchmark]: TraceAbstraction took 815197.04ms. Allocated memory was 178.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 116.9MB in the beginning and 568.7MB in the end (delta: -451.8MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-13 08:40:13,623 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.12ms. Allocated memory is still 178.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.36ms. Allocated memory is still 178.3MB. Free memory was 154.1MB in the beginning and 142.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.57ms. Allocated memory is still 178.3MB. Free memory was 142.0MB in the beginning and 139.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.51ms. Allocated memory is still 178.3MB. Free memory was 139.9MB in the beginning and 138.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 516.02ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 118.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 815197.04ms. Allocated memory was 178.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 116.9MB in the beginning and 568.7MB in the end (delta: -451.8MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 111 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 48 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 654, independent: 654, independent conditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 0, Positive unconditional cache size: 1066, 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, 42 TransitionsBefore, 42 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, 39 PlacesBefore, 39 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 90 TransitionsBefore, 90 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, 45 PlacesBefore, 45 PlacesAfterwards, 137 TransitionsBefore, 137 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, 49 PlacesBefore, 49 PlacesAfterwards, 334 TransitionsBefore, 334 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, 53 PlacesBefore, 53 PlacesAfterwards, 318 TransitionsBefore, 318 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, 56 PlacesBefore, 56 PlacesAfterwards, 444 TransitionsBefore, 444 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, 486 TransitionsBefore, 486 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, 61 PlacesBefore, 61 PlacesAfterwards, 420 TransitionsBefore, 420 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, 62 PlacesBefore, 62 PlacesAfterwards, 349 TransitionsBefore, 349 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, 65 PlacesBefore, 65 PlacesAfterwards, 730 TransitionsBefore, 730 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, 1396 TransitionsBefore, 1396 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, 83 PlacesBefore, 83 PlacesAfterwards, 3088 TransitionsBefore, 3088 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, 119 PlacesBefore, 119 PlacesAfterwards, 8300 TransitionsBefore, 8300 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.4s, 147 PlacesBefore, 147 PlacesAfterwards, 26139 TransitionsBefore, 26139 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: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1856859 conditions, 108785 events (79455/108784 cut-off events. For 15543/15543 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 772850 event pairs, 27 based on Foata normal form. 448/85254 useless extension candidates. Maximal degree in co-relation 1851134. Up to 108776 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 139 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.0s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 795.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2120 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2120 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3233 IncrementalHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 0 mSDtfsCounter, 3233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 362 SyntacticMatches, 18 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848826occurred in iteration=15, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 4909 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2096 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 63/113 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