/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:25:54,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:25:54,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:25:54,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:25:54,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:25:54,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:25:54,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:25:54,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:25:54,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:25:54,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:25:54,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:25:54,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:25:54,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:25:54,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:25:54,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:25:54,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:25:54,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:25:54,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:25:54,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:25:54,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:25:54,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:25:54,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:25:54,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:25:54,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:25:54,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:25:54,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:25:54,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:25:54,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:25:54,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:25:54,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:25:54,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:25:54,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:25:54,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:25:54,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:25:54,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:25:54,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:25:54,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:25:54,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:25:54,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:25:54,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:25:54,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:25:54,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:25:54,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:25:54,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:25:54,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:25:54,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:25:54,184 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:25:54,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:25:54,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:25:54,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:25:54,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:25:54,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:25:54,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:25:54,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:25:54,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:25:54,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:25:54,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:25:54,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:25:54,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:25:54,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:25:54,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:25:54,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:25:54,463 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:25:54,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 02:25:55,340 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:25:55,529 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:25:55,529 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 02:25:55,541 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66536305e/d91a94be81114c1088ec5d25f63fddd3/FLAG2ff07439f [2022-12-06 02:25:55,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66536305e/d91a94be81114c1088ec5d25f63fddd3 [2022-12-06 02:25:55,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:25:55,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:25:55,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:25:55,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:25:55,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:25:55,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64357a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55, skipping insertion in model container [2022-12-06 02:25:55,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:25:55,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:25:55,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,748 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 02:25:55,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:25:55,763 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:25:55,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:25:55,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:25:55,797 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 02:25:55,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:25:55,816 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:25:55,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55 WrapperNode [2022-12-06 02:25:55,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:25:55,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:25:55,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:25:55,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:25:55,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,865 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-06 02:25:55,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:25:55,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:25:55,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:25:55,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:25:55,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:25:55,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:25:55,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:25:55,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:25:55,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (1/1) ... [2022-12-06 02:25:55,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:25:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:25:55,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:25:55,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:25:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:25:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:25:55,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:25:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:25:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:25:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:25:55,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:25:55,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:25:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:25:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:25:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 02:25:55,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 02:25:55,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:25:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:25:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:25:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:25:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:25:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:25:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:25:55,993 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:25:56,087 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:25:56,088 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:25:56,371 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:25:56,557 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:25:56,557 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:25:56,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:25:56 BoogieIcfgContainer [2022-12-06 02:25:56,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:25:56,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:25:56,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:25:56,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:25:56,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:25:55" (1/3) ... [2022-12-06 02:25:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae3b4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:25:56, skipping insertion in model container [2022-12-06 02:25:56,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:25:55" (2/3) ... [2022-12-06 02:25:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae3b4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:25:56, skipping insertion in model container [2022-12-06 02:25:56,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:25:56" (3/3) ... [2022-12-06 02:25:56,564 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 02:25:56,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:25:56,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:25:56,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:25:56,697 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 02:25:56,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 02:25:56,817 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 02:25:56,817 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:25:56,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 02:25:56,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 02:25:56,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-06 02:25:56,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:25:56,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 02:25:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-06 02:25:56,874 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-06 02:25:56,875 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:25:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 19/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 02:25:56,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 02:25:56,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-06 02:26:06,133 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 02:26:06,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:26:06,151 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;@135a9974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:26:06,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 02:26:06,158 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 02:26:06,158 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 02:26:06,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:06,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:06,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-06 02:26:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:06,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781170363] [2022-12-06 02:26:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:06,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781170363] [2022-12-06 02:26:06,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781170363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:26:06,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:26:06,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:26:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405645480] [2022-12-06 02:26:06,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:26:06,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:26:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:06,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:26:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:26:06,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 02:26:06,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:06,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:06,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 02:26:06,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:07,124 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-06 02:26:07,124 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 02:26:07,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14384 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2022-12-06 02:26:07,143 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-06 02:26:07,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-06 02:26:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:26:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:26:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 02:26:07,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-06 02:26:07,154 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-06 02:26:07,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:07,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 84 transitions, 387 flow [2022-12-06 02:26:07,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 84 transitions, 387 flow [2022-12-06 02:26:07,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 02:26:07,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:26:07,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 02:26:07,389 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 84 transitions, 387 flow [2022-12-06 02:26:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:07,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:07,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:26:07,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-06 02:26:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:07,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479299173] [2022-12-06 02:26:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:07,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479299173] [2022-12-06 02:26:07,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479299173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:26:07,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:26:07,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:26:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073769029] [2022-12-06 02:26:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:26:07,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:26:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:26:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:26:07,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-06 02:26:07,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 84 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:07,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:07,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-06 02:26:07,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:08,014 INFO L130 PetriNetUnfolder]: 4289/5750 cut-off events. [2022-12-06 02:26:08,015 INFO L131 PetriNetUnfolder]: For 1118/1180 co-relation queries the response was YES. [2022-12-06 02:26:08,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 5750 events. 4289/5750 cut-off events. For 1118/1180 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26295 event pairs, 815 based on Foata normal form. 192/4206 useless extension candidates. Maximal degree in co-relation 8533. Up to 3469 conditions per place. [2022-12-06 02:26:08,036 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 64 selfloop transitions, 2 changer transitions 72/148 dead transitions. [2022-12-06 02:26:08,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 148 transitions, 973 flow [2022-12-06 02:26:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:26:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:26:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 02:26:08,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2022-12-06 02:26:08,038 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 02:26:08,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:08,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 148 transitions, 973 flow [2022-12-06 02:26:08,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 148 transitions, 973 flow [2022-12-06 02:26:08,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-06 02:26:12,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:26:12,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4533 [2022-12-06 02:26:12,572 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 147 transitions, 967 flow [2022-12-06 02:26:12,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:12,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:12,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:12,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:26:12,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 494754686, now seen corresponding path program 1 times [2022-12-06 02:26:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:12,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296668293] [2022-12-06 02:26:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:12,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296668293] [2022-12-06 02:26:12,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296668293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:26:12,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871701989] [2022-12-06 02:26:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:26:12,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:26:12,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:26:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:13,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:26:13,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:26:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:13,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:26:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:13,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871701989] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:26:13,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:26:13,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-12-06 02:26:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663401244] [2022-12-06 02:26:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:26:13,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:26:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:13,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:26:13,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:26:13,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 02:26:13,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 147 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:13,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:13,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 02:26:13,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:14,144 INFO L130 PetriNetUnfolder]: 6428/8302 cut-off events. [2022-12-06 02:26:14,144 INFO L131 PetriNetUnfolder]: For 2453/2673 co-relation queries the response was YES. [2022-12-06 02:26:14,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32598 conditions, 8302 events. 6428/8302 cut-off events. For 2453/2673 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 37073 event pairs, 357 based on Foata normal form. 21/5614 useless extension candidates. Maximal degree in co-relation 24399. Up to 5838 conditions per place. [2022-12-06 02:26:14,192 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 155 selfloop transitions, 20 changer transitions 114/292 dead transitions. [2022-12-06 02:26:14,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 292 transitions, 2501 flow [2022-12-06 02:26:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:26:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:26:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-12-06 02:26:14,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4774436090225564 [2022-12-06 02:26:14,196 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 02:26:14,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:14,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 292 transitions, 2501 flow [2022-12-06 02:26:14,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 292 transitions, 2501 flow [2022-12-06 02:26:14,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 1032 [2022-12-06 02:26:14,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:26:14,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 803 [2022-12-06 02:26:15,000 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 292 transitions, 2501 flow [2022-12-06 02:26:15,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:15,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:15,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:15,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:26:15,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:15,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1529528197, now seen corresponding path program 1 times [2022-12-06 02:26:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:15,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518671039] [2022-12-06 02:26:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:16,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518671039] [2022-12-06 02:26:16,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518671039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:26:16,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103042230] [2022-12-06 02:26:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:16,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:26:16,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:26:16,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:26:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:16,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 02:26:16,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:26:16,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 02:26:16,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:26:16,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:26:16,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:26:16,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:26:16,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 02:26:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:16,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:26:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:17,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103042230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:26:17,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:26:17,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:26:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724608911] [2022-12-06 02:26:17,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:26:17,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:26:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:17,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:26:17,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=447, Unknown=9, NotChecked=0, Total=552 [2022-12-06 02:26:17,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2022-12-06 02:26:17,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 292 transitions, 2501 flow. Second operand has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:17,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:17,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2022-12-06 02:26:17,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:20,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:26:22,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:26:27,271 INFO L130 PetriNetUnfolder]: 19647/25665 cut-off events. [2022-12-06 02:26:27,271 INFO L131 PetriNetUnfolder]: For 7838/8149 co-relation queries the response was YES. [2022-12-06 02:26:27,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126054 conditions, 25665 events. 19647/25665 cut-off events. For 7838/8149 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 134037 event pairs, 401 based on Foata normal form. 181/17333 useless extension candidates. Maximal degree in co-relation 74804. Up to 20030 conditions per place. [2022-12-06 02:26:27,446 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 733 selfloop transitions, 125 changer transitions 297/1162 dead transitions. [2022-12-06 02:26:27,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 1162 transitions, 12224 flow [2022-12-06 02:26:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 02:26:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 02:26:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 492 transitions. [2022-12-06 02:26:27,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43006993006993005 [2022-12-06 02:26:27,450 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-06 02:26:27,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:27,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 1162 transitions, 12224 flow [2022-12-06 02:26:27,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 1162 transitions, 12224 flow [2022-12-06 02:26:27,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 2864 [2022-12-06 02:26:48,981 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 02:26:48,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21531 [2022-12-06 02:26:48,982 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 1158 transitions, 12184 flow [2022-12-06 02:26:48,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:48,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:48,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:49,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:26:49,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 02:26:49,186 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1345829515, now seen corresponding path program 1 times [2022-12-06 02:26:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:49,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126788648] [2022-12-06 02:26:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:49,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:26:49,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:49,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126788648] [2022-12-06 02:26:49,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126788648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:26:49,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:26:49,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:26:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561325402] [2022-12-06 02:26:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:26:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:26:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:26:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:26:49,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 57 [2022-12-06 02:26:49,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 1158 transitions, 12184 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:49,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:49,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 57 [2022-12-06 02:26:49,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:26:52,461 INFO L130 PetriNetUnfolder]: 20598/27402 cut-off events. [2022-12-06 02:26:52,461 INFO L131 PetriNetUnfolder]: For 17884/18290 co-relation queries the response was YES. [2022-12-06 02:26:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159157 conditions, 27402 events. 20598/27402 cut-off events. For 17884/18290 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 150345 event pairs, 540 based on Foata normal form. 12/19304 useless extension candidates. Maximal degree in co-relation 83118. Up to 22585 conditions per place. [2022-12-06 02:26:52,598 INFO L137 encePairwiseOnDemand]: 40/57 looper letters, 993 selfloop transitions, 6 changer transitions 410/1455 dead transitions. [2022-12-06 02:26:52,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 1455 transitions, 18265 flow [2022-12-06 02:26:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:26:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:26:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-12-06 02:26:52,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2022-12-06 02:26:52,601 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2022-12-06 02:26:52,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:26:52,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 1455 transitions, 18265 flow [2022-12-06 02:26:52,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 1455 transitions, 18265 flow [2022-12-06 02:26:52,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 3526 [2022-12-06 02:26:52,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:26:52,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-06 02:26:52,987 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 1455 transitions, 18265 flow [2022-12-06 02:26:52,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:52,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:26:52,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:26:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:26:52,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:26:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:26:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -500268544, now seen corresponding path program 1 times [2022-12-06 02:26:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:26:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143254761] [2022-12-06 02:26:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:26:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:26:54,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143254761] [2022-12-06 02:26:54,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143254761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:26:54,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869448207] [2022-12-06 02:26:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:26:54,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:26:54,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:26:54,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:26:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:26:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:26:54,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 02:26:54,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:26:54,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2022-12-06 02:26:54,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:26:54,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:26:54,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 02:26:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:54,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:26:55,044 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:26:55,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2022-12-06 02:26:55,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-12-06 02:26:55,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-06 02:26:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:26:55,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869448207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:26:55,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:26:55,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2022-12-06 02:26:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592229253] [2022-12-06 02:26:55,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:26:55,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:26:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:26:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:26:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=330, Unknown=5, NotChecked=0, Total=420 [2022-12-06 02:26:55,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 54 [2022-12-06 02:26:55,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 1455 transitions, 18265 flow. Second operand has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:26:55,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:26:55,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 54 [2022-12-06 02:26:55,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:13,331 INFO L130 PetriNetUnfolder]: 30945/42577 cut-off events. [2022-12-06 02:27:13,331 INFO L131 PetriNetUnfolder]: For 29013/29860 co-relation queries the response was YES. [2022-12-06 02:27:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290884 conditions, 42577 events. 30945/42577 cut-off events. For 29013/29860 co-relation queries the response was YES. Maximal size of possible extension queue 1832. Compared 274174 event pairs, 725 based on Foata normal form. 94/31708 useless extension candidates. Maximal degree in co-relation 74712. Up to 36066 conditions per place. [2022-12-06 02:27:13,613 INFO L137 encePairwiseOnDemand]: 35/54 looper letters, 2014 selfloop transitions, 307 changer transitions 687/3011 dead transitions. [2022-12-06 02:27:13,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 3011 transitions, 43982 flow [2022-12-06 02:27:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:27:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 02:27:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 715 transitions. [2022-12-06 02:27:13,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33101851851851855 [2022-12-06 02:27:13,617 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2022-12-06 02:27:13,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:13,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 3011 transitions, 43982 flow [2022-12-06 02:27:13,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 3011 transitions, 43982 flow [2022-12-06 02:27:13,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 7552 [2022-12-06 02:27:14,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:14,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-06 02:27:14,084 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 3011 transitions, 43982 flow [2022-12-06 02:27:14,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.333333333333333) internal successors, (133), 21 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:14,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:14,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:14,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:14,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:14,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:27:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -326053618, now seen corresponding path program 2 times [2022-12-06 02:27:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:14,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477359986] [2022-12-06 02:27:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477359986] [2022-12-06 02:27:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477359986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920770589] [2022-12-06 02:27:15,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:15,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:15,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:27:15,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:15,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:15,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 02:27:15,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:15,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 02:27:15,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:15,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 02:27:15,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:27:15,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:15,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:15,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:27:15,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 02:27:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:15,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:18,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920770589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:18,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:18,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-12-06 02:27:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107292436] [2022-12-06 02:27:18,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:18,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:27:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:27:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=176, Unknown=5, NotChecked=0, Total=240 [2022-12-06 02:27:18,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 55 [2022-12-06 02:27:18,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 3011 transitions, 43982 flow. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:18,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:18,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 55 [2022-12-06 02:27:18,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:24,756 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 62 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:27:41,753 INFO L130 PetriNetUnfolder]: 38593/53779 cut-off events. [2022-12-06 02:27:41,753 INFO L131 PetriNetUnfolder]: For 39472/40191 co-relation queries the response was YES. [2022-12-06 02:27:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419842 conditions, 53779 events. 38593/53779 cut-off events. For 39472/40191 co-relation queries the response was YES. Maximal size of possible extension queue 2451. Compared 366516 event pairs, 1274 based on Foata normal form. 22/40973 useless extension candidates. Maximal degree in co-relation 120521. Up to 45476 conditions per place. [2022-12-06 02:27:42,144 INFO L137 encePairwiseOnDemand]: 31/55 looper letters, 3011 selfloop transitions, 275 changer transitions 978/4275 dead transitions. [2022-12-06 02:27:42,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 4275 transitions, 70970 flow [2022-12-06 02:27:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:27:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:27:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 241 transitions. [2022-12-06 02:27:42,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36515151515151517 [2022-12-06 02:27:42,146 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places. [2022-12-06 02:27:42,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:42,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 4275 transitions, 70970 flow [2022-12-06 02:27:42,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 4275 transitions, 70970 flow [2022-12-06 02:27:42,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 10584 [2022-12-06 02:27:51,437 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:27:51,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9292 [2022-12-06 02:27:51,438 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 4274 transitions, 70954 flow [2022-12-06 02:27:51,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:51,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:51,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:51,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:51,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:27:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1352633403, now seen corresponding path program 1 times [2022-12-06 02:27:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:51,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130311388] [2022-12-06 02:27:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130311388] [2022-12-06 02:27:52,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130311388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081724672] [2022-12-06 02:27:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:52,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:52,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:52,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:27:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:52,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 02:27:52,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:52,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:52,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 242 [2022-12-06 02:27:52,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 02:27:52,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:52,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 02:27:52,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 02:27:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:52,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:53,243 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:27:53,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 154 [2022-12-06 02:27:53,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2022-12-06 02:27:53,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-12-06 02:27:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:53,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081724672] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:53,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 21 [2022-12-06 02:27:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638375865] [2022-12-06 02:27:53,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:53,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:27:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:27:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=404, Unknown=3, NotChecked=0, Total=506 [2022-12-06 02:27:53,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 60 [2022-12-06 02:27:53,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 4274 transitions, 70954 flow. Second operand has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:53,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:53,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 60 [2022-12-06 02:27:53,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:42,471 INFO L130 PetriNetUnfolder]: 72770/100747 cut-off events. [2022-12-06 02:28:42,471 INFO L131 PetriNetUnfolder]: For 64835/65630 co-relation queries the response was YES. [2022-12-06 02:28:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891180 conditions, 100747 events. 72770/100747 cut-off events. For 64835/65630 co-relation queries the response was YES. Maximal size of possible extension queue 4726. Compared 732522 event pairs, 1550 based on Foata normal form. 209/74826 useless extension candidates. Maximal degree in co-relation 187533. Up to 87209 conditions per place. [2022-12-06 02:28:43,241 INFO L137 encePairwiseOnDemand]: 26/60 looper letters, 4871 selfloop transitions, 774 changer transitions 2238/7886 dead transitions. [2022-12-06 02:28:43,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 7886 transitions, 146949 flow [2022-12-06 02:28:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 02:28:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 02:28:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 834 transitions. [2022-12-06 02:28:43,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33095238095238094 [2022-12-06 02:28:43,249 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places. [2022-12-06 02:28:43,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:43,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 7886 transitions, 146949 flow [2022-12-06 02:28:44,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 7886 transitions, 146949 flow [2022-12-06 02:28:44,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 19448 [2022-12-06 02:28:44,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:44,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1167 [2022-12-06 02:28:44,417 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 7886 transitions, 146949 flow [2022-12-06 02:28:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:44,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:44,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:44,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:44,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:44,623 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:28:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1959828549, now seen corresponding path program 2 times [2022-12-06 02:28:44,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:44,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153466085] [2022-12-06 02:28:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:44,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153466085] [2022-12-06 02:28:45,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153466085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10480473] [2022-12-06 02:28:45,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:45,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:45,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:28:45,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:45,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:45,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:28:45,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:45,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-06 02:28:45,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:45,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:45,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:28:45,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:28:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:45,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:48,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:48,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 330 [2022-12-06 02:28:48,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 266 [2022-12-06 02:28:48,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 242 [2022-12-06 02:28:48,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 230 [2022-12-06 02:28:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10480473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:48,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2022-12-06 02:28:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918844908] [2022-12-06 02:28:48,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:48,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:28:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:28:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=232, Unknown=4, NotChecked=0, Total=306 [2022-12-06 02:28:48,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-06 02:28:48,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 7886 transitions, 146949 flow. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:48,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:48,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-06 02:28:48,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:29,923 INFO L130 PetriNetUnfolder]: 82846/114719 cut-off events. [2022-12-06 02:30:29,923 INFO L131 PetriNetUnfolder]: For 87750/88542 co-relation queries the response was YES. [2022-12-06 02:30:30,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129039 conditions, 114719 events. 82846/114719 cut-off events. For 87750/88542 co-relation queries the response was YES. Maximal size of possible extension queue 5389. Compared 850555 event pairs, 1841 based on Foata normal form. 73/84570 useless extension candidates. Maximal degree in co-relation 232954. Up to 100077 conditions per place. [2022-12-06 02:30:30,799 INFO L137 encePairwiseOnDemand]: 28/62 looper letters, 5889 selfloop transitions, 478 changer transitions 2566/8951 dead transitions. [2022-12-06 02:30:30,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 8951 transitions, 184738 flow [2022-12-06 02:30:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:30:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:30:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 289 transitions. [2022-12-06 02:30:30,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33294930875576034 [2022-12-06 02:30:30,801 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2022-12-06 02:30:30,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:30,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 8951 transitions, 184738 flow [2022-12-06 02:30:31,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 8951 transitions, 184738 flow [2022-12-06 02:30:31,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 22112 [2022-12-06 02:30:31,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:31,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1046 [2022-12-06 02:30:31,847 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 8951 transitions, 184738 flow [2022-12-06 02:30:31,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:31,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:31,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:31,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:32,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:32,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:30:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash 796178813, now seen corresponding path program 1 times [2022-12-06 02:30:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:32,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576475276] [2022-12-06 02:30:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:30:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:32,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576475276] [2022-12-06 02:30:32,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576475276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:32,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896149502] [2022-12-06 02:30:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:32,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:32,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:30:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:32,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:30:32,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:30:32,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:30:32,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896149502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:30:32,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:30:32,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 02:30:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848356835] [2022-12-06 02:30:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:30:32,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:30:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:30:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:30:32,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-06 02:30:32,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 8951 transitions, 184738 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:32,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:32,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-06 02:30:32,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:54,011 INFO L130 PetriNetUnfolder]: 107937/152691 cut-off events. [2022-12-06 02:32:54,011 INFO L131 PetriNetUnfolder]: For 273492/274628 co-relation queries the response was YES. [2022-12-06 02:32:54,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561376 conditions, 152691 events. 107937/152691 cut-off events. For 273492/274628 co-relation queries the response was YES. Maximal size of possible extension queue 6548. Compared 1177158 event pairs, 8493 based on Foata normal form. 12/118675 useless extension candidates. Maximal degree in co-relation 296477. Up to 125090 conditions per place. [2022-12-06 02:32:55,207 INFO L137 encePairwiseOnDemand]: 47/62 looper letters, 7691 selfloop transitions, 194 changer transitions 3262/11373 dead transitions. [2022-12-06 02:32:55,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 11373 transitions, 257362 flow [2022-12-06 02:32:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:32:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:32:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-12-06 02:32:55,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2022-12-06 02:32:55,208 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2022-12-06 02:32:55,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:55,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 11373 transitions, 257362 flow [2022-12-06 02:32:56,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 11373 transitions, 257362 flow [2022-12-06 02:32:56,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 9656 [2022-12-06 02:32:56,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:56,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1271 [2022-12-06 02:32:56,481 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 11373 transitions, 257362 flow [2022-12-06 02:32:56,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:56,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:56,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:56,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:32:56,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:56,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:32:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2056089189, now seen corresponding path program 1 times [2022-12-06 02:32:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:56,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478059339] [2022-12-06 02:32:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478059339] [2022-12-06 02:32:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478059339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094653297] [2022-12-06 02:32:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:57,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:32:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:57,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 02:32:57,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:57,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2022-12-06 02:32:57,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:32:57,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:32:57,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:32:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:57,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:57,777 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_759 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_759) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:32:57,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:57,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2022-12-06 02:32:57,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-12-06 02:32:57,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-12-06 02:32:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:57,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094653297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:57,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:57,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-06 02:32:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199152950] [2022-12-06 02:32:57,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:57,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:32:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:32:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=4, NotChecked=30, Total=306 [2022-12-06 02:32:57,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 62 [2022-12-06 02:32:57,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 11373 transitions, 257362 flow. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:57,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:57,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 62 [2022-12-06 02:32:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:37:40,075 INFO L130 PetriNetUnfolder]: 125848/178120 cut-off events. [2022-12-06 02:37:40,076 INFO L131 PetriNetUnfolder]: For 363696/365170 co-relation queries the response was YES. [2022-12-06 02:37:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990981 conditions, 178120 events. 125848/178120 cut-off events. For 363696/365170 co-relation queries the response was YES. Maximal size of possible extension queue 7626. Compared 1398445 event pairs, 9778 based on Foata normal form. 553/137834 useless extension candidates. Maximal degree in co-relation 374477. Up to 147424 conditions per place. [2022-12-06 02:37:41,623 INFO L137 encePairwiseOnDemand]: 35/62 looper letters, 9079 selfloop transitions, 503 changer transitions 3770/13371 dead transitions. [2022-12-06 02:37:41,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 13371 transitions, 329488 flow [2022-12-06 02:37:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:37:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:37:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 346 transitions. [2022-12-06 02:37:41,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3487903225806452 [2022-12-06 02:37:41,625 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2022-12-06 02:37:41,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:37:41,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 13371 transitions, 329488 flow [2022-12-06 02:37:43,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 13371 transitions, 329488 flow [2022-12-06 02:37:43,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 11150 [2022-12-06 02:37:50,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:37:50,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9008 [2022-12-06 02:37:50,633 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 13370 transitions, 329464 flow [2022-12-06 02:37:50,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:37:50,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:37:50,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:37:50,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:37:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 02:37:50,839 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 02:37:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:37:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1811085439, now seen corresponding path program 1 times [2022-12-06 02:37:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:37:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027083876] [2022-12-06 02:37:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:37:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:37:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:37:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:37:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:37:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027083876] [2022-12-06 02:37:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027083876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:37:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675318885] [2022-12-06 02:37:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:37:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:37:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:37:51,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:37:51,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:37:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:37:51,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 02:37:51,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:37:52,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:37:52,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:37:52,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:37:52,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:37:52,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:37:52,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:37:52,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 02:37:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:37:52,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:37:52,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_840) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:37:54,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_840) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-12-06 02:37:54,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:37:54,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1362 treesize of output 1302 [2022-12-06 02:37:54,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1286 treesize of output 1238 [2022-12-06 02:37:54,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1238 treesize of output 1046 [2022-12-06 02:37:54,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 950 [2022-12-06 02:37:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:37:54,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675318885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:37:54,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:37:54,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 02:37:54,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211632923] [2022-12-06 02:37:54,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:37:54,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:37:54,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:37:54,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:37:54,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=218, Unknown=5, NotChecked=62, Total=342 [2022-12-06 02:37:54,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 63 [2022-12-06 02:37:54,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 13370 transitions, 329464 flow. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:37:54,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:37:54,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 63 [2022-12-06 02:37:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:39:27,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:39:27,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:39:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:39:27,679 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 02:39:27,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:27,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:27,886 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). [2022-12-06 02:39:27,887 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 02:39:27,888 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 02:39:27,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 02:39:27,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 02:39:27,889 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:27,891 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:39:27,891 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:39:27,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:39:27 BasicIcfg [2022-12-06 02:39:27,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:39:27,900 INFO L158 Benchmark]: Toolchain (without parser) took 812343.28ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 159.3MB in the beginning and 746.1MB in the end (delta: -586.8MB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2022-12-06 02:39:27,900 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 112.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:39:27,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.57ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 143.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 02:39:27,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.50ms. Allocated memory is still 183.5MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:39:27,904 INFO L158 Benchmark]: Boogie Preprocessor took 30.54ms. Allocated memory is still 183.5MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:39:27,904 INFO L158 Benchmark]: RCFGBuilder took 662.54ms. Allocated memory is still 183.5MB. Free memory was 138.8MB in the beginning and 94.3MB in the end (delta: 44.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-06 02:39:27,904 INFO L158 Benchmark]: TraceAbstraction took 811339.70ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 93.7MB in the beginning and 746.1MB in the end (delta: -652.4MB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-06 02:39:27,908 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory was 160.2MB in the beginning and 160.1MB in the end (delta: 112.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.57ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 143.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.50ms. Allocated memory is still 183.5MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.54ms. Allocated memory is still 183.5MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 662.54ms. Allocated memory is still 183.5MB. Free memory was 138.8MB in the beginning and 94.3MB in the end (delta: 44.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 811339.70ms. Allocated memory was 183.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 93.7MB in the beginning and 746.1MB in the end (delta: -652.4MB). 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: 9.3s, 204 PlacesBefore, 42 PlacesAfterwards, 210 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 948, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 962, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1343, Positive conditional cache size: 0, Positive unconditional cache size: 1343, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 47 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 51 PlacesBefore, 50 PlacesAfterwards, 148 TransitionsBefore, 147 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 56 PlacesBefore, 56 PlacesAfterwards, 292 TransitionsBefore, 292 TransitionsAfterwards, 1032 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.4s, 81 PlacesBefore, 77 PlacesAfterwards, 1162 TransitionsBefore, 1158 TransitionsAfterwards, 2864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 1455 TransitionsBefore, 1455 TransitionsAfterwards, 3526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 119 PlacesBefore, 119 PlacesAfterwards, 3011 TransitionsBefore, 3011 TransitionsAfterwards, 7552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 130 PlacesBefore, 129 PlacesAfterwards, 4275 TransitionsBefore, 4274 TransitionsAfterwards, 10584 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 170 PlacesBefore, 170 PlacesAfterwards, 7886 TransitionsBefore, 7886 TransitionsAfterwards, 19448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 183 PlacesBefore, 183 PlacesAfterwards, 8951 TransitionsBefore, 8951 TransitionsAfterwards, 22112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 185 PlacesBefore, 185 PlacesAfterwards, 11373 TransitionsBefore, 11373 TransitionsAfterwards, 9656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 200 PlacesBefore, 199 PlacesAfterwards, 13371 TransitionsBefore, 13370 TransitionsAfterwards, 11150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). - TimeoutResultAtElement [Line: 141]: 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 (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). - TimeoutResultAtElement [Line: 140]: 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 (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). - TimeoutResultAtElement [Line: 142]: 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 (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). - TimeoutResultAtElement [Line: 143]: 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 (19states, 4/63 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 589456 conditions, 48744 events (35176/48743 cut-off events. For 206674/208218 co-relation queries the response was YES. Maximal size of possible extension queue 7484. Compared 375600 event pairs, 3053 based on Foata normal form. 11/43311 useless extension candidates. Maximal degree in co-relation 228543. Up to 38144 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 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: 811.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 729.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 234 mSolverCounterUnknown, 3734 SdHoareTripleChecker+Valid, 13.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3734 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 416 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 692 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10387 IncrementalHoareTripleChecker+Invalid, 11729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 692 mSolverCounterUnsat, 6 mSDtfsCounter, 10387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 396 SyntacticMatches, 18 SemanticMatches, 261 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2098 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329488occurred in iteration=11, InterpolantAutomatonStates: 175, 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, 1.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 809 ConstructedInterpolants, 48 QuantifiedInterpolants, 20843 SizeOfPredicates, 225 NumberOfNonLiveVariables, 3155 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 11/55 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