/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:25:39,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:25:39,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:25:39,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:25:39,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:25:39,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:25:39,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:25:39,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:25:39,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:25:39,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:25:39,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:25:39,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:25:39,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:25:39,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:25:39,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:25:39,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:25:39,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:25:39,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:25:39,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:25:39,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:25:39,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:25:39,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:25:39,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:25:39,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:25:39,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:25:39,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:25:39,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:25:39,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:25:39,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:25:39,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:25:39,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:25:39,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:25:39,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:25:39,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:25:39,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:25:39,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:25:39,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:25:39,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:25:39,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:25:39,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:25:39,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:25:39,891 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 00:25:39,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:25:39,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:25:39,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:25:39,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:25:39,917 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:25:39,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:25:39,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:25:39,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:25:39,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:25:39,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:25:39,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:25:39,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:25:39,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:25:39,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:25:39,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:25:39,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:25:40,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:25:40,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:25:40,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:25:40,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:25:40,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:25:40,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-06 00:25:41,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:25:41,380 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:25:41,382 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-06 00:25:41,386 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818c87807/0421f23b37674dc8919948a00126f662/FLAGf85f7c228 [2022-12-06 00:25:41,397 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818c87807/0421f23b37674dc8919948a00126f662 [2022-12-06 00:25:41,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:25:41,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:25:41,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:25:41,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:25:41,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:25:41,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f97ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41, skipping insertion in model container [2022-12-06 00:25:41,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:25:41,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:25:41,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,542 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-send-receive-alt.wvr.c[2650,2663] [2022-12-06 00:25:41,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:25:41,552 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:25:41,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:25:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:25:41,566 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-send-receive-alt.wvr.c[2650,2663] [2022-12-06 00:25:41,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:25:41,579 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:25:41,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41 WrapperNode [2022-12-06 00:25:41,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:25:41,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:25:41,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:25:41,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:25:41,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,607 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-12-06 00:25:41,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:25:41,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:25:41,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:25:41,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:25:41,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,622 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:25:41,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:25:41,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:25:41,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:25:41,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (1/1) ... [2022-12-06 00:25:41,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:25:41,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:41,650 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 00:25:41,653 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 00:25:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:25:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:25:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:25:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:25:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:25:41,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:25:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:25:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:25:41,680 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 00:25:41,785 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:25:41,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:25:42,008 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:25:42,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:25:42,077 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:25:42,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:25:42 BoogieIcfgContainer [2022-12-06 00:25:42,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:25:42,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:25:42,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:25:42,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:25:42,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:25:41" (1/3) ... [2022-12-06 00:25:42,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c56de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:25:42, skipping insertion in model container [2022-12-06 00:25:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:25:41" (2/3) ... [2022-12-06 00:25:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c56de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:25:42, skipping insertion in model container [2022-12-06 00:25:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:25:42" (3/3) ... [2022-12-06 00:25:42,084 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-12-06 00:25:42,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:25:42,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:25:42,096 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:25:42,167 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:25:42,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 122 transitions, 260 flow [2022-12-06 00:25:42,244 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-06 00:25:42,244 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:25:42,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 120 events. 11/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 00:25:42,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 122 transitions, 260 flow [2022-12-06 00:25:42,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 112 transitions, 236 flow [2022-12-06 00:25:42,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:42,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 112 transitions, 236 flow [2022-12-06 00:25:42,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 112 transitions, 236 flow [2022-12-06 00:25:42,320 INFO L130 PetriNetUnfolder]: 11/112 cut-off events. [2022-12-06 00:25:42,320 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:25:42,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 11/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 00:25:42,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 112 transitions, 236 flow [2022-12-06 00:25:42,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 00:25:45,865 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 00:25:45,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:25:45,899 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;@1fa0136a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:25:45,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:25:45,907 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 00:25:45,907 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:25:45,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:45,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:45,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1610035340, now seen corresponding path program 1 times [2022-12-06 00:25:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:45,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751640701] [2022-12-06 00:25:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:46,151 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 00:25:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:46,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751640701] [2022-12-06 00:25:46,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751640701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:46,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:46,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:25:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565457078] [2022-12-06 00:25:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:46,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:25:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:25:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:25:46,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 00:25:46,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:46,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 00:25:46,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:46,223 INFO L130 PetriNetUnfolder]: 64/113 cut-off events. [2022-12-06 00:25:46,223 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 00:25:46,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 113 events. 64/113 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 335 event pairs, 13 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 162. Up to 66 conditions per place. [2022-12-06 00:25:46,224 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 19 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 00:25:46,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 123 flow [2022-12-06 00:25:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:25:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:25:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 00:25:46,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 00:25:46,232 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 29 transitions. [2022-12-06 00:25:46,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 123 flow [2022-12-06 00:25:46,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:25:46,235 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2022-12-06 00:25:46,238 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-06 00:25:46,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:46,239 INFO L89 Accepts]: Start accepts. Operand has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:46,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:46,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,245 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 00:25:46,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:25:46,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-06 00:25:46,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:25:46,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:46,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 00:25:46,246 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 48 flow [2022-12-06 00:25:46,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:46,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:46,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:25:46,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1695124947, now seen corresponding path program 1 times [2022-12-06 00:25:46,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:46,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186649309] [2022-12-06 00:25:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:46,342 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 00:25:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:46,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186649309] [2022-12-06 00:25:46,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186649309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:46,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:46,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:25:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890128800] [2022-12-06 00:25:46,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:46,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:25:46,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:25:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:25:46,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 00:25:46,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:46,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 00:25:46,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:46,383 INFO L130 PetriNetUnfolder]: 48/96 cut-off events. [2022-12-06 00:25:46,384 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 00:25:46,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 96 events. 48/96 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 226 event pairs, 15 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 123. Up to 66 conditions per place. [2022-12-06 00:25:46,384 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 16 selfloop transitions, 2 changer transitions 5/24 dead transitions. [2022-12-06 00:25:46,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 24 transitions, 110 flow [2022-12-06 00:25:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:25:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:25:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 00:25:46,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 00:25:46,386 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 48 flow. Second operand 3 states and 26 transitions. [2022-12-06 00:25:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 24 transitions, 110 flow [2022-12-06 00:25:46,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 24 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:25:46,387 INFO L231 Difference]: Finished difference. Result has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=21, PETRI_TRANSITIONS=18} [2022-12-06 00:25:46,387 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2022-12-06 00:25:46,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:46,387 INFO L89 Accepts]: Start accepts. Operand has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:46,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:46,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,392 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 00:25:46,393 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:25:46,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 5 conditions per place. [2022-12-06 00:25:46,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 00:25:46,394 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:46,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 00:25:46,395 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 58 flow [2022-12-06 00:25:46,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:46,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:46,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:46,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:25:46,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1003160808, now seen corresponding path program 1 times [2022-12-06 00:25:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184182951] [2022-12-06 00:25:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:25:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184182951] [2022-12-06 00:25:46,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184182951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:46,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:46,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:25:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114992261] [2022-12-06 00:25:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:46,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:25:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:25:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:25:46,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 00:25:46,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 00:25:46,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:46,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 00:25:46,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:46,635 INFO L130 PetriNetUnfolder]: 57/126 cut-off events. [2022-12-06 00:25:46,635 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 00:25:46,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 126 events. 57/126 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 394 event pairs, 40 based on Foata normal form. 6/130 useless extension candidates. Maximal degree in co-relation 202. Up to 95 conditions per place. [2022-12-06 00:25:46,639 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 16 selfloop transitions, 2 changer transitions 10/29 dead transitions. [2022-12-06 00:25:46,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 29 transitions, 140 flow [2022-12-06 00:25:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:25:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:25:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 00:25:46,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-06 00:25:46,641 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 58 flow. Second operand 4 states and 31 transitions. [2022-12-06 00:25:46,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 29 transitions, 140 flow [2022-12-06 00:25:46,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 29 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:25:46,642 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 70 flow [2022-12-06 00:25:46,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-12-06 00:25:46,643 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-06 00:25:46,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:46,643 INFO L89 Accepts]: Start accepts. Operand has 25 places, 19 transitions, 70 flow [2022-12-06 00:25:46,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:46,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:46,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 70 flow [2022-12-06 00:25:46,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 70 flow [2022-12-06 00:25:46,651 INFO L130 PetriNetUnfolder]: 4/26 cut-off events. [2022-12-06 00:25:46,651 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:25:46,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 5 conditions per place. [2022-12-06 00:25:46,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 19 transitions, 70 flow [2022-12-06 00:25:46,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 00:25:47,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:25:47,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 744 [2022-12-06 00:25:47,387 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 66 flow [2022-12-06 00:25:47,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 00:25:47,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:47,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:47,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:25:47,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1888013319, now seen corresponding path program 1 times [2022-12-06 00:25:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:47,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969512566] [2022-12-06 00:25:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:47,885 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 00:25:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969512566] [2022-12-06 00:25:47,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969512566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:25:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589917292] [2022-12-06 00:25:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:47,909 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 00:25:47,911 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 00:25:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:47,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 00:25:47,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:25:48,026 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 16 treesize of output 12 [2022-12-06 00:25:48,051 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 00:25:48,081 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 00:25:48,161 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 00:25:48,176 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 00:25:48,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:25:48,429 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 00:25:48,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589917292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:25:48,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:25:48,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 00:25:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935877318] [2022-12-06 00:25:48,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:25:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:25:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:25:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=253, Unknown=1, NotChecked=0, Total=342 [2022-12-06 00:25:48,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 00:25:48,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 66 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 00:25:48,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:48,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 00:25:48,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:48,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse11)) (.cse3 (+ c_~queue~0.offset .cse10)) (.cse0 (not (< c_~back~0 c_~n~0))) (.cse5 (not (<= 0 c_~back~0)))) (and (not (< 1 c_~sum~0)) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 (let ((.cse1 (+ c_~sum~0 (select .cse2 .cse3)))) (and (not (< .cse1 0)) (not (< 1 .cse1)))) (not (= (select .cse2 .cse4) 1)) .cse5)) (or (let ((.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_72 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_72) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse6 .cse7)) 0)) (not (= (select .cse6 .cse8) 1))))) (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_72 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_72) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse8) 1)) (not (< 1 (+ c_~sum~0 (select .cse9 .cse7))))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse5) (not (< c_~sum~0 0)) (or (and (forall ((v_ArrVal_73 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) c_~queue~0.base))) (or (not (= (select .cse12 .cse4) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 .cse3))))))) (forall ((v_ArrVal_73 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_73) c_~queue~0.base))) (or (not (= (select .cse13 .cse4) 1)) (not (< (+ c_~sum~0 (select .cse13 .cse3)) 0)))))) .cse0 .cse5)))) is different from false [2022-12-06 00:25:49,160 INFO L130 PetriNetUnfolder]: 171/326 cut-off events. [2022-12-06 00:25:49,160 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 00:25:49,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 326 events. 171/326 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1273 event pairs, 3 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 777. Up to 73 conditions per place. [2022-12-06 00:25:49,161 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 37 selfloop transitions, 19 changer transitions 45/101 dead transitions. [2022-12-06 00:25:49,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 101 transitions, 494 flow [2022-12-06 00:25:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:25:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:25:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 105 transitions. [2022-12-06 00:25:49,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2022-12-06 00:25:49,163 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 66 flow. Second operand 17 states and 105 transitions. [2022-12-06 00:25:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 101 transitions, 494 flow [2022-12-06 00:25:49,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 101 transitions, 478 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:25:49,165 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 185 flow [2022-12-06 00:25:49,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=185, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-06 00:25:49,166 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-06 00:25:49,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:49,166 INFO L89 Accepts]: Start accepts. Operand has 44 places, 32 transitions, 185 flow [2022-12-06 00:25:49,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:49,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:49,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 185 flow [2022-12-06 00:25:49,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 185 flow [2022-12-06 00:25:49,172 INFO L130 PetriNetUnfolder]: 11/68 cut-off events. [2022-12-06 00:25:49,172 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 00:25:49,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 68 events. 11/68 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 244 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 126. Up to 14 conditions per place. [2022-12-06 00:25:49,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 185 flow [2022-12-06 00:25:49,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 00:25:49,436 WARN L322 ript$VariableManager]: TermVariable LBE222 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:49,436 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:49,522 WARN L322 ript$VariableManager]: TermVariable LBE222 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:49,522 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:51,373 WARN L322 ript$VariableManager]: TermVariable LBE84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:51,374 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:51,374 WARN L322 ript$VariableManager]: TermVariable LBE220 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:51,374 WARN L322 ript$VariableManager]: TermVariable LBE67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:51,621 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:25:51,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2457 [2022-12-06 00:25:51,623 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 193 flow [2022-12-06 00:25:51,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 00:25:51,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:51,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:51,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:25:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:51,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1325654954, now seen corresponding path program 1 times [2022-12-06 00:25:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818791891] [2022-12-06 00:25:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:51,902 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 00:25:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:51,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818791891] [2022-12-06 00:25:51,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818791891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:51,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:51,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:25:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636430229] [2022-12-06 00:25:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:51,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:25:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:25:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:25:51,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:25:51,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:51,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:51,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:25:51,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:51,992 INFO L130 PetriNetUnfolder]: 227/436 cut-off events. [2022-12-06 00:25:51,993 INFO L131 PetriNetUnfolder]: For 462/462 co-relation queries the response was YES. [2022-12-06 00:25:51,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 436 events. 227/436 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1849 event pairs, 36 based on Foata normal form. 12/440 useless extension candidates. Maximal degree in co-relation 1100. Up to 206 conditions per place. [2022-12-06 00:25:51,994 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 35 selfloop transitions, 12 changer transitions 1/48 dead transitions. [2022-12-06 00:25:51,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 368 flow [2022-12-06 00:25:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:25:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:25:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 00:25:51,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-06 00:25:51,996 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 193 flow. Second operand 4 states and 41 transitions. [2022-12-06 00:25:51,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 368 flow [2022-12-06 00:25:52,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 335 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 00:25:52,001 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 238 flow [2022-12-06 00:25:52,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-06 00:25:52,003 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2022-12-06 00:25:52,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:52,003 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 238 flow [2022-12-06 00:25:52,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:52,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:52,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 238 flow [2022-12-06 00:25:52,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 238 flow [2022-12-06 00:25:52,011 INFO L130 PetriNetUnfolder]: 12/86 cut-off events. [2022-12-06 00:25:52,011 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 00:25:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 86 events. 12/86 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 363 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 219. Up to 18 conditions per place. [2022-12-06 00:25:52,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 238 flow [2022-12-06 00:25:52,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 00:25:52,013 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:52,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:25:52,014 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 238 flow [2022-12-06 00:25:52,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:52,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:52,016 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:52,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:25:52,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash 196599622, now seen corresponding path program 1 times [2022-12-06 00:25:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:52,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239848204] [2022-12-06 00:25:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:25:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:52,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239848204] [2022-12-06 00:25:52,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239848204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:25:52,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:25:52,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:25:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014054482] [2022-12-06 00:25:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:25:52,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:25:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:25:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:25:52,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:25:52,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:52,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:52,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:25:52,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:52,159 INFO L130 PetriNetUnfolder]: 185/367 cut-off events. [2022-12-06 00:25:52,159 INFO L131 PetriNetUnfolder]: For 681/681 co-relation queries the response was YES. [2022-12-06 00:25:52,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 367 events. 185/367 cut-off events. For 681/681 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1507 event pairs, 140 based on Foata normal form. 10/376 useless extension candidates. Maximal degree in co-relation 1235. Up to 250 conditions per place. [2022-12-06 00:25:52,160 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 23 selfloop transitions, 0 changer transitions 15/38 dead transitions. [2022-12-06 00:25:52,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 324 flow [2022-12-06 00:25:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:25:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:25:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 00:25:52,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 00:25:52,162 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 238 flow. Second operand 3 states and 31 transitions. [2022-12-06 00:25:52,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 324 flow [2022-12-06 00:25:52,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 306 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:25:52,165 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 147 flow [2022-12-06 00:25:52,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 00:25:52,167 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-06 00:25:52,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:52,167 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 147 flow [2022-12-06 00:25:52,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:52,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:52,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 147 flow [2022-12-06 00:25:52,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 147 flow [2022-12-06 00:25:52,173 INFO L130 PetriNetUnfolder]: 7/51 cut-off events. [2022-12-06 00:25:52,173 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-06 00:25:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 51 events. 7/51 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 116. Up to 11 conditions per place. [2022-12-06 00:25:52,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 147 flow [2022-12-06 00:25:52,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 00:25:52,175 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:25:52,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 00:25:52,177 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 147 flow [2022-12-06 00:25:52,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:52,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:52,177 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:52,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:25:52,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1528038232, now seen corresponding path program 1 times [2022-12-06 00:25:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838382279] [2022-12-06 00:25:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:52,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:52,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838382279] [2022-12-06 00:25:52,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838382279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:25:52,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327846841] [2022-12-06 00:25:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:52,933 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 00:25:52,949 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 00:25:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:53,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 00:25:53,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:25:53,220 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-06 00:25:53,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 17 [2022-12-06 00:25:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:53,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:25:53,452 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-06 00:25:53,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 78 [2022-12-06 00:25:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:53,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327846841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:25:53,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:25:53,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 00:25:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996381294] [2022-12-06 00:25:53,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:25:53,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:25:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:53,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:25:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-12-06 00:25:53,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 00:25:53,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 147 flow. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:53,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:53,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 00:25:53,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:25:55,970 INFO L130 PetriNetUnfolder]: 573/1075 cut-off events. [2022-12-06 00:25:55,970 INFO L131 PetriNetUnfolder]: For 1616/1616 co-relation queries the response was YES. [2022-12-06 00:25:55,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1075 events. 573/1075 cut-off events. For 1616/1616 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5642 event pairs, 76 based on Foata normal form. 18/1093 useless extension candidates. Maximal degree in co-relation 3395. Up to 222 conditions per place. [2022-12-06 00:25:55,975 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 108 selfloop transitions, 45 changer transitions 62/215 dead transitions. [2022-12-06 00:25:55,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 215 transitions, 1426 flow [2022-12-06 00:25:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 00:25:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 00:25:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 210 transitions. [2022-12-06 00:25:55,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 00:25:55,976 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 147 flow. Second operand 25 states and 210 transitions. [2022-12-06 00:25:55,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 215 transitions, 1426 flow [2022-12-06 00:25:55,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 215 transitions, 1314 flow, removed 46 selfloop flow, removed 8 redundant places. [2022-12-06 00:25:55,981 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 726 flow [2022-12-06 00:25:55,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=726, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2022-12-06 00:25:55,981 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 45 predicate places. [2022-12-06 00:25:55,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:25:55,981 INFO L89 Accepts]: Start accepts. Operand has 65 places, 73 transitions, 726 flow [2022-12-06 00:25:55,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:25:55,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:25:55,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 73 transitions, 726 flow [2022-12-06 00:25:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 73 transitions, 726 flow [2022-12-06 00:25:55,999 INFO L130 PetriNetUnfolder]: 34/204 cut-off events. [2022-12-06 00:25:55,999 INFO L131 PetriNetUnfolder]: For 908/908 co-relation queries the response was YES. [2022-12-06 00:25:55,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 204 events. 34/204 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1277 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 503. Up to 38 conditions per place. [2022-12-06 00:25:56,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 73 transitions, 726 flow [2022-12-06 00:25:56,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 00:25:56,001 WARN L322 ript$VariableManager]: TermVariable LBE84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,001 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,001 WARN L322 ript$VariableManager]: TermVariable LBE220 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,001 WARN L322 ript$VariableManager]: TermVariable LBE67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,416 WARN L322 ript$VariableManager]: TermVariable LBE222 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,416 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,499 WARN L322 ript$VariableManager]: TermVariable LBE84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,499 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,499 WARN L322 ript$VariableManager]: TermVariable LBE220 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:56,499 WARN L322 ript$VariableManager]: TermVariable LBE67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:25:58,615 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:25:58,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2635 [2022-12-06 00:25:58,616 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 750 flow [2022-12-06 00:25:58,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:25:58,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:25:58,616 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:58,636 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 00:25:58,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 00:25:58,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:25:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:25:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1476155778, now seen corresponding path program 1 times [2022-12-06 00:25:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:25:58,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491033915] [2022-12-06 00:25:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:25:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:25:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491033915] [2022-12-06 00:25:59,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491033915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:25:59,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327301186] [2022-12-06 00:25:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:25:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:25:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:25:59,213 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 00:25:59,216 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 00:25:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:25:59,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:25:59,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:25:59,296 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 00:25:59,298 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 00:25:59,318 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 00:25:59,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:25:59,396 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 48 treesize of output 14 [2022-12-06 00:25:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:59,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:25:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:25:59,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327301186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:25:59,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:25:59,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 00:25:59,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020776862] [2022-12-06 00:25:59,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:25:59,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:25:59,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:25:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:25:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=178, Unknown=1, NotChecked=0, Total=240 [2022-12-06 00:25:59,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 00:25:59,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 750 flow. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 00:25:59,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:25:59,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 00:25:59,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:26:05,961 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 59 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:26:06,333 INFO L130 PetriNetUnfolder]: 722/1342 cut-off events. [2022-12-06 00:26:06,333 INFO L131 PetriNetUnfolder]: For 3822/3822 co-relation queries the response was YES. [2022-12-06 00:26:06,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 1342 events. 722/1342 cut-off events. For 3822/3822 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7480 event pairs, 194 based on Foata normal form. 4/1335 useless extension candidates. Maximal degree in co-relation 4532. Up to 776 conditions per place. [2022-12-06 00:26:06,341 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 88 selfloop transitions, 28 changer transitions 34/150 dead transitions. [2022-12-06 00:26:06,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 150 transitions, 1451 flow [2022-12-06 00:26:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:26:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:26:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-12-06 00:26:06,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3852813852813853 [2022-12-06 00:26:06,342 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 750 flow. Second operand 11 states and 89 transitions. [2022-12-06 00:26:06,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 150 transitions, 1451 flow [2022-12-06 00:26:06,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 150 transitions, 1133 flow, removed 159 selfloop flow, removed 0 redundant places. [2022-12-06 00:26:06,397 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 739 flow [2022-12-06 00:26:06,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=739, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2022-12-06 00:26:06,399 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2022-12-06 00:26:06,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:26:06,399 INFO L89 Accepts]: Start accepts. Operand has 79 places, 86 transitions, 739 flow [2022-12-06 00:26:06,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:26:06,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:26:06,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 86 transitions, 739 flow [2022-12-06 00:26:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 86 transitions, 739 flow [2022-12-06 00:26:06,424 INFO L130 PetriNetUnfolder]: 45/250 cut-off events. [2022-12-06 00:26:06,425 INFO L131 PetriNetUnfolder]: For 988/988 co-relation queries the response was YES. [2022-12-06 00:26:06,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 250 events. 45/250 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1670 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 554. Up to 46 conditions per place. [2022-12-06 00:26:06,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 86 transitions, 739 flow [2022-12-06 00:26:06,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-06 00:26:06,428 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:26:06,428 WARN L322 ript$VariableManager]: TermVariable LBE220 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:26:06,428 WARN L322 ript$VariableManager]: TermVariable LBE67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:26:06,428 WARN L322 ript$VariableManager]: TermVariable LBE84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:26:06,442 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 00:26:06,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:26:06,634 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet4#1_72 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:26:06,637 INFO L158 Benchmark]: Toolchain (without parser) took 25236.93ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 168.2MB in the beginning and 423.9MB in the end (delta: -255.6MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,637 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:26:06,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.45ms. Allocated memory is still 192.9MB. Free memory was 168.2MB in the beginning and 156.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 192.9MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,638 INFO L158 Benchmark]: Boogie Preprocessor took 17.00ms. Allocated memory is still 192.9MB. Free memory was 153.9MB in the beginning and 152.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,638 INFO L158 Benchmark]: RCFGBuilder took 453.11ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 131.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,638 INFO L158 Benchmark]: TraceAbstraction took 24556.68ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 130.3MB in the beginning and 423.9MB in the end (delta: -293.5MB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. [2022-12-06 00:26:06,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.45ms. Allocated memory is still 192.9MB. Free memory was 168.2MB in the beginning and 156.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 192.9MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.00ms. Allocated memory is still 192.9MB. Free memory was 153.9MB in the beginning and 152.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 453.11ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 131.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 24556.68ms. Allocated memory was 192.9MB in the beginning and 487.6MB in the end (delta: 294.6MB). Free memory was 130.3MB in the beginning and 423.9MB in the end (delta: -293.5MB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 108 PlacesBefore, 20 PlacesAfterwards, 112 TransitionsBefore, 16 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 26 ConcurrentYvCompositions, 8 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 400, independent conditional: 400, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 362, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 362, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 362, unknown conditional: 0, unknown unconditional: 362] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 630, Positive conditional cache size: 0, Positive unconditional cache size: 630, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 19 PlacesBefore, 19 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 48 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.7s, 24 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 48 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: 2.4s, 44 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 13, independent unconditional: 4, 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: 17, independent: 17, independent conditional: 13, independent unconditional: 4, 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: 15, independent: 15, independent conditional: 13, independent unconditional: 2, 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: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 13, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 22, Positive conditional cache size: 20, Positive unconditional cache size: 2, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 120 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): 22, Positive cache size: 22, Positive conditional cache size: 20, Positive unconditional cache size: 2, 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, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 74 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): 22, Positive cache size: 22, Positive conditional cache size: 20, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 65 PlacesBefore, 65 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 44, Positive unconditional cache size: 2, 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: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet4#1_72 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet4#1_72 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:26:06,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...