/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:33:07,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:33:07,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:33:07,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:33:07,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:33:07,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:33:07,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:33:07,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:33:07,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:33:07,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:33:07,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:33:07,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:33:07,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:33:07,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:33:07,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:33:07,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:33:07,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:33:07,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:33:07,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:33:07,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:33:07,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:33:07,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:33:07,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:33:07,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:33:07,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:33:07,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:33:07,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:33:07,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:33:07,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:33:07,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:33:07,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:33:07,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:33:07,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:33:07,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:33:07,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:33:07,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:33:07,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:33:07,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:33:07,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:33:07,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:33:07,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:33:07,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:33:07,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:33:07,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:33:07,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:33:07,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:33:07,786 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:33:07,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:33:07,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:33:07,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:33:07,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:33:07,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:33:07,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:33:07,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:33:07,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:33:07,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:33:07,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:33:07,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:33:07,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:33:07,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:33:07,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:33:08,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:33:08,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:33:08,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:33:08,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:33:08,142 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:33:08,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-12-06 02:33:09,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:33:09,512 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:33:09,512 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-12-06 02:33:09,521 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4234041f/ce4f3efd0bff48eb85777b78178aa4d4/FLAG36b32d545 [2022-12-06 02:33:09,536 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4234041f/ce4f3efd0bff48eb85777b78178aa4d4 [2022-12-06 02:33:09,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:33:09,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:33:09,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:33:09,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:33:09,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:33:09,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b299b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09, skipping insertion in model container [2022-12-06 02:33:09,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:33:09,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:33:09,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,771 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-commit-1.wvr.c[4604,4617] [2022-12-06 02:33:09,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:33:09,785 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:33:09,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:33:09,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:33:09,824 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-commit-1.wvr.c[4604,4617] [2022-12-06 02:33:09,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:33:09,838 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:33:09,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09 WrapperNode [2022-12-06 02:33:09,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:33:09,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:33:09,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:33:09,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:33:09,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,879 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 333 [2022-12-06 02:33:09,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:33:09,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:33:09,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:33:09,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:33:09,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:33:09,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:33:09,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:33:09,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:33:09,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (1/1) ... [2022-12-06 02:33:09,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:33:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:09,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:33:09,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:33:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:33:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:33:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:33:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:33:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:33:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:33:09,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:33:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:33:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:33:09,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:33:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:33:09,974 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:33:10,085 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:33:10,087 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:33:10,561 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:33:10,746 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:33:10,746 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:33:10,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:33:10 BoogieIcfgContainer [2022-12-06 02:33:10,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:33:10,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:33:10,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:33:10,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:33:10,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:33:09" (1/3) ... [2022-12-06 02:33:10,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67922123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:33:10, skipping insertion in model container [2022-12-06 02:33:10,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:33:09" (2/3) ... [2022-12-06 02:33:10,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67922123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:33:10, skipping insertion in model container [2022-12-06 02:33:10,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:33:10" (3/3) ... [2022-12-06 02:33:10,759 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-12-06 02:33:10,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:33:10,776 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:33:10,776 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:33:10,849 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:33:10,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 234 transitions, 492 flow [2022-12-06 02:33:10,972 INFO L130 PetriNetUnfolder]: 19/231 cut-off events. [2022-12-06 02:33:10,972 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:33:10,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 231 events. 19/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 132 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2022-12-06 02:33:10,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 234 transitions, 492 flow [2022-12-06 02:33:10,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 221 transitions, 460 flow [2022-12-06 02:33:10,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:11,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 221 transitions, 460 flow [2022-12-06 02:33:11,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 221 transitions, 460 flow [2022-12-06 02:33:11,075 INFO L130 PetriNetUnfolder]: 19/221 cut-off events. [2022-12-06 02:33:11,075 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:33:11,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 221 events. 19/221 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 131 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 196. Up to 2 conditions per place. [2022-12-06 02:33:11,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 221 transitions, 460 flow [2022-12-06 02:33:11,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-06 02:33:19,615 INFO L203 LiptonReduction]: Total number of compositions: 191 [2022-12-06 02:33:19,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:33:19,631 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;@1aa9ab95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:33:19,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:33:19,636 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 02:33:19,636 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:33:19,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:19,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:19,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 340144083, now seen corresponding path program 1 times [2022-12-06 02:33:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:19,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733517169] [2022-12-06 02:33:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:20,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:20,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733517169] [2022-12-06 02:33:20,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733517169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:20,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:20,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:33:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072173583] [2022-12-06 02:33:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:20,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:33:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:33:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:33:20,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 02:33:20,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:20,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:20,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 02:33:20,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:20,318 INFO L130 PetriNetUnfolder]: 451/666 cut-off events. [2022-12-06 02:33:20,319 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 02:33:20,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 666 events. 451/666 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2319 event pairs, 73 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1134. Up to 548 conditions per place. [2022-12-06 02:33:20,334 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 42 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2022-12-06 02:33:20,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 221 flow [2022-12-06 02:33:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:33:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:33:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 02:33:20,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 02:33:20,351 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 02:33:20,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:20,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 47 transitions, 221 flow [2022-12-06 02:33:20,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 47 transitions, 221 flow [2022-12-06 02:33:20,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:20,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:33:20,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-06 02:33:20,691 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 47 transitions, 221 flow [2022-12-06 02:33:20,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:20,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:20,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:33:20,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -437421631, now seen corresponding path program 1 times [2022-12-06 02:33:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:20,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522412341] [2022-12-06 02:33:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:20,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522412341] [2022-12-06 02:33:20,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522412341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:20,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:20,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:33:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697482033] [2022-12-06 02:33:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:20,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:33:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:33:20,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:33:20,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 02:33:20,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 47 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:20,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:20,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 02:33:20,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:21,097 INFO L130 PetriNetUnfolder]: 514/790 cut-off events. [2022-12-06 02:33:21,098 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-06 02:33:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 790 events. 514/790 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2983 event pairs, 94 based on Foata normal form. 16/620 useless extension candidates. Maximal degree in co-relation 1675. Up to 667 conditions per place. [2022-12-06 02:33:21,103 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 45 selfloop transitions, 2 changer transitions 28/75 dead transitions. [2022-12-06 02:33:21,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 75 transitions, 507 flow [2022-12-06 02:33:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:33:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:33:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 02:33:21,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-12-06 02:33:21,110 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 02:33:21,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:21,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 75 transitions, 507 flow [2022-12-06 02:33:21,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 75 transitions, 507 flow [2022-12-06 02:33:21,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:24,979 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:33:24,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3870 [2022-12-06 02:33:24,980 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 74 transitions, 503 flow [2022-12-06 02:33:24,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:24,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:24,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:24,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:33:24,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1740120825, now seen corresponding path program 1 times [2022-12-06 02:33:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122006260] [2022-12-06 02:33:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:25,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122006260] [2022-12-06 02:33:25,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122006260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:25,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:25,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:33:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950614156] [2022-12-06 02:33:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:25,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:33:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:33:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:33:25,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:33:25,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 74 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:25,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:25,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:33:25,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:25,433 INFO L130 PetriNetUnfolder]: 712/1097 cut-off events. [2022-12-06 02:33:25,434 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-06 02:33:25,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 1097 events. 712/1097 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4358 event pairs, 94 based on Foata normal form. 52/885 useless extension candidates. Maximal degree in co-relation 3420. Up to 1015 conditions per place. [2022-12-06 02:33:25,440 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 61 selfloop transitions, 2 changer transitions 22/85 dead transitions. [2022-12-06 02:33:25,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 85 transitions, 746 flow [2022-12-06 02:33:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:33:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:33:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 02:33:25,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 02:33:25,442 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-06 02:33:25,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:25,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 85 transitions, 746 flow [2022-12-06 02:33:25,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 85 transitions, 746 flow [2022-12-06 02:33:25,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:26,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:33:26,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 559 [2022-12-06 02:33:26,002 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 85 transitions, 748 flow [2022-12-06 02:33:26,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:26,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:26,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:26,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:33:26,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1957076107, now seen corresponding path program 1 times [2022-12-06 02:33:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262812891] [2022-12-06 02:33:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262812891] [2022-12-06 02:33:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262812891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:33:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766737257] [2022-12-06 02:33:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:33:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:33:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:33:26,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:33:26,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 85 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:26,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:26,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:33:26,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:26,311 INFO L130 PetriNetUnfolder]: 513/816 cut-off events. [2022-12-06 02:33:26,313 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 02:33:26,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 816 events. 513/816 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3111 event pairs, 102 based on Foata normal form. 0/666 useless extension candidates. Maximal degree in co-relation 3166. Up to 734 conditions per place. [2022-12-06 02:33:26,322 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 55 selfloop transitions, 2 changer transitions 25/82 dead transitions. [2022-12-06 02:33:26,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 82 transitions, 883 flow [2022-12-06 02:33:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:33:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:33:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 02:33:26,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 02:33:26,325 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 02:33:26,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:26,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 82 transitions, 883 flow [2022-12-06 02:33:26,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 82 transitions, 883 flow [2022-12-06 02:33:26,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:26,331 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:26,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:33:26,339 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 82 transitions, 883 flow [2022-12-06 02:33:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:26,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:26,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:26,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:33:26,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1930680990, now seen corresponding path program 1 times [2022-12-06 02:33:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:26,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710955686] [2022-12-06 02:33:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:26,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710955686] [2022-12-06 02:33:26,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710955686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:26,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:26,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:33:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720657077] [2022-12-06 02:33:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:26,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:33:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:33:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:33:26,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:33:26,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 82 transitions, 883 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:26,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:26,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:33:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:26,708 INFO L130 PetriNetUnfolder]: 633/1056 cut-off events. [2022-12-06 02:33:26,709 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-06 02:33:26,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6508 conditions, 1056 events. 633/1056 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4408 event pairs, 196 based on Foata normal form. 18/888 useless extension candidates. Maximal degree in co-relation 3786. Up to 892 conditions per place. [2022-12-06 02:33:26,716 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 54 selfloop transitions, 6 changer transitions 67/127 dead transitions. [2022-12-06 02:33:26,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 127 transitions, 1629 flow [2022-12-06 02:33:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:33:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:33:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 02:33:26,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-06 02:33:26,721 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-06 02:33:26,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:26,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 127 transitions, 1629 flow [2022-12-06 02:33:26,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 127 transitions, 1629 flow [2022-12-06 02:33:26,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:27,470 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:33:27,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 750 [2022-12-06 02:33:27,471 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 127 transitions, 1639 flow [2022-12-06 02:33:27,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:27,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:27,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:33:27,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1590325006, now seen corresponding path program 1 times [2022-12-06 02:33:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:27,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717648379] [2022-12-06 02:33:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:27,617 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 02:33:27,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:27,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717648379] [2022-12-06 02:33:27,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717648379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:27,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:27,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:33:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544852381] [2022-12-06 02:33:27,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:27,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:33:27,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:33:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:33:27,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:33:27,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 127 transitions, 1639 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:27,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:27,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:33:27,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:27,876 INFO L130 PetriNetUnfolder]: 867/1514 cut-off events. [2022-12-06 02:33:27,876 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-06 02:33:27,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10871 conditions, 1514 events. 867/1514 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7428 event pairs, 352 based on Foata normal form. 26/1334 useless extension candidates. Maximal degree in co-relation 4406. Up to 1190 conditions per place. [2022-12-06 02:33:27,886 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 56 selfloop transitions, 3 changer transitions 143/202 dead transitions. [2022-12-06 02:33:27,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 202 transitions, 3011 flow [2022-12-06 02:33:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:33:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:33:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 02:33:27,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-06 02:33:27,888 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-06 02:33:27,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:27,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 202 transitions, 3011 flow [2022-12-06 02:33:27,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 202 transitions, 3011 flow [2022-12-06 02:33:27,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:28,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:33:28,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-06 02:33:28,249 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 202 transitions, 3019 flow [2022-12-06 02:33:28,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:28,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:28,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:28,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:33:28,249 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1457443513, now seen corresponding path program 1 times [2022-12-06 02:33:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:28,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964485752] [2022-12-06 02:33:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:28,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964485752] [2022-12-06 02:33:28,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964485752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:28,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:28,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:33:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878263889] [2022-12-06 02:33:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:33:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:33:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:33:28,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:33:28,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 202 transitions, 3019 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:28,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:28,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:33:28,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:28,556 INFO L130 PetriNetUnfolder]: 571/1048 cut-off events. [2022-12-06 02:33:28,556 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 02:33:28,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8579 conditions, 1048 events. 571/1048 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4556 event pairs, 350 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 3133. Up to 724 conditions per place. [2022-12-06 02:33:28,563 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 44 selfloop transitions, 2 changer transitions 129/175 dead transitions. [2022-12-06 02:33:28,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 175 transitions, 2959 flow [2022-12-06 02:33:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:33:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:33:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 02:33:28,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2022-12-06 02:33:28,565 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-06 02:33:28,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:28,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 175 transitions, 2959 flow [2022-12-06 02:33:28,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 175 transitions, 2959 flow [2022-12-06 02:33:28,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:28,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:28,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:33:28,574 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 175 transitions, 2959 flow [2022-12-06 02:33:28,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:28,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:28,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:28,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:33:28,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1599616193, now seen corresponding path program 1 times [2022-12-06 02:33:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:28,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426363192] [2022-12-06 02:33:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:28,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426363192] [2022-12-06 02:33:28,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426363192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:28,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:28,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:33:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790004098] [2022-12-06 02:33:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:28,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:33:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:28,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:33:28,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:33:28,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:33:28,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 175 transitions, 2959 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:28,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:28,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:33:28,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:29,095 INFO L130 PetriNetUnfolder]: 1009/1706 cut-off events. [2022-12-06 02:33:29,095 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 02:33:29,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15576 conditions, 1706 events. 1009/1706 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7285 event pairs, 340 based on Foata normal form. 24/1464 useless extension candidates. Maximal degree in co-relation 9279. Up to 1382 conditions per place. [2022-12-06 02:33:29,108 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 74 selfloop transitions, 12 changer transitions 132/218 dead transitions. [2022-12-06 02:33:29,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 218 transitions, 4101 flow [2022-12-06 02:33:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:33:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:33:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 02:33:29,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2022-12-06 02:33:29,110 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-06 02:33:29,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:29,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 218 transitions, 4101 flow [2022-12-06 02:33:29,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 218 transitions, 4101 flow [2022-12-06 02:33:29,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:29,123 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:29,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 02:33:29,123 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 218 transitions, 4101 flow [2022-12-06 02:33:29,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:29,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:29,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:29,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:33:29,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:29,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1487137515, now seen corresponding path program 1 times [2022-12-06 02:33:29,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:29,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545804700] [2022-12-06 02:33:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:29,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:29,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545804700] [2022-12-06 02:33:29,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545804700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:33:29,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:33:29,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:33:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414854304] [2022-12-06 02:33:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:33:29,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:33:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:29,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:33:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:33:29,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:33:29,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 218 transitions, 4101 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:29,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:29,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:33:29,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:29,780 INFO L130 PetriNetUnfolder]: 1189/2085 cut-off events. [2022-12-06 02:33:29,780 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-06 02:33:29,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21160 conditions, 2085 events. 1189/2085 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9774 event pairs, 488 based on Foata normal form. 2/1794 useless extension candidates. Maximal degree in co-relation 10306. Up to 1761 conditions per place. [2022-12-06 02:33:29,794 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 85 selfloop transitions, 2 changer transitions 216/303 dead transitions. [2022-12-06 02:33:29,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 303 transitions, 6315 flow [2022-12-06 02:33:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:33:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:33:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 02:33:29,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-06 02:33:29,796 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-06 02:33:29,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:29,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 303 transitions, 6315 flow [2022-12-06 02:33:29,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 303 transitions, 6315 flow [2022-12-06 02:33:29,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:33,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:33:33,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4162 [2022-12-06 02:33:33,958 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 302 transitions, 6295 flow [2022-12-06 02:33:33,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:33,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:33,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:33,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 02:33:33,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1557983501, now seen corresponding path program 1 times [2022-12-06 02:33:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302313970] [2022-12-06 02:33:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:34,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302313970] [2022-12-06 02:33:34,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302313970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:34,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892484637] [2022-12-06 02:33:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:34,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:34,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:33:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:34,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 02:33:34,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:34,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:33:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:33:34,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892484637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:33:34,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:33:34,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:33:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065113503] [2022-12-06 02:33:34,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:33:34,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:33:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:33:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:33:34,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:33:34,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 302 transitions, 6295 flow. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:34,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:34,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:33:34,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:35,445 INFO L130 PetriNetUnfolder]: 1726/3185 cut-off events. [2022-12-06 02:33:35,446 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-12-06 02:33:35,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35553 conditions, 3185 events. 1726/3185 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 17804 event pairs, 825 based on Foata normal form. 114/2902 useless extension candidates. Maximal degree in co-relation 11333. Up to 2619 conditions per place. [2022-12-06 02:33:35,462 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 80 selfloop transitions, 7 changer transitions 440/527 dead transitions. [2022-12-06 02:33:35,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 527 transitions, 12041 flow [2022-12-06 02:33:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:33:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:33:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-12-06 02:33:35,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 02:33:35,465 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-06 02:33:35,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:35,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 527 transitions, 12041 flow [2022-12-06 02:33:35,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 527 transitions, 12041 flow [2022-12-06 02:33:35,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:35,493 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:35,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 02:33:35,494 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 527 transitions, 12041 flow [2022-12-06 02:33:35,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:35,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:35,495 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:35,501 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 02:33:35,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 02:33:35,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:33:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1753663416, now seen corresponding path program 2 times [2022-12-06 02:33:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:35,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141905866] [2022-12-06 02:33:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141905866] [2022-12-06 02:33:39,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141905866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739417468] [2022-12-06 02:33:39,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:33:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:39,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:39,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:33:39,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:33:39,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:33:39,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-06 02:33:39,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:39,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:39,763 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-06 02:33:39,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-12-06 02:33:39,798 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 02:33:39,799 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 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-06 02:33:39,881 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-06 02:33:39,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-06 02:33:39,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:40,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:40,110 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:33:40,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:33:40,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:40,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:40,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:40,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:33:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:41,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:34:00,267 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:34:15,344 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:34:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:15,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739417468] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:34:15,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:34:15,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 49 [2022-12-06 02:34:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102897263] [2022-12-06 02:34:15,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:34:15,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-06 02:34:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:34:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-06 02:34:15,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=2104, Unknown=16, NotChecked=0, Total=2550 [2022-12-06 02:34:15,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:34:15,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 527 transitions, 12041 flow. Second operand has 51 states, 50 states have (on average 1.8) internal successors, (90), 50 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:34:15,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:34:15,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:34:15,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:35:00,217 WARN L233 SmtUtils]: Spent 40.15s on a formula simplification. DAG size of input: 496 DAG size of output: 462 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:35:11,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:36:09,454 WARN L233 SmtUtils]: Spent 43.40s on a formula simplification. DAG size of input: 419 DAG size of output: 396 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:36:51,680 WARN L233 SmtUtils]: Spent 37.11s on a formula simplification. DAG size of input: 280 DAG size of output: 264 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:36:55,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:36:57,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:12,040 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 109 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:37:17,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:20,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:22,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:24,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:26,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:28,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:31,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:33,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:35,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:37:51,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:38:42,682 WARN L233 SmtUtils]: Spent 50.53s on a formula simplification. DAG size of input: 411 DAG size of output: 406 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:39:44,617 WARN L233 SmtUtils]: Spent 59.41s on a formula simplification. DAG size of input: 423 DAG size of output: 418 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:40:47,833 WARN L233 SmtUtils]: Spent 51.00s on a formula simplification. DAG size of input: 424 DAG size of output: 401 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:40:49,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:40:54,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:40:56,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:40:59,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:41:01,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:41:04,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:41:05,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:41:07,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:41:11,852 INFO L130 PetriNetUnfolder]: 4689/8632 cut-off events. [2022-12-06 02:41:11,852 INFO L131 PetriNetUnfolder]: For 1157/1157 co-relation queries the response was YES. [2022-12-06 02:41:11,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104999 conditions, 8632 events. 4689/8632 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 59440 event pairs, 1310 based on Foata normal form. 7/7350 useless extension candidates. Maximal degree in co-relation 28457. Up to 7479 conditions per place. [2022-12-06 02:41:11,901 INFO L137 encePairwiseOnDemand]: 11/34 looper letters, 301 selfloop transitions, 146 changer transitions 1332/1779 dead transitions. [2022-12-06 02:41:11,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1779 transitions, 44046 flow [2022-12-06 02:41:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-12-06 02:41:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2022-12-06 02:41:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 487 transitions. [2022-12-06 02:41:11,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17683369644153957 [2022-12-06 02:41:11,905 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 111 predicate places. [2022-12-06 02:41:11,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:11,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 1779 transitions, 44046 flow [2022-12-06 02:41:12,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 1779 transitions, 44046 flow [2022-12-06 02:41:12,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:42,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:42:42,607 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,SelfDestructingSolverStorable10 [2022-12-06 02:42:42,608 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 28 out of bounds for length 28 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) 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 02:42:42,613 INFO L158 Benchmark]: Toolchain (without parser) took 573073.92ms. Allocated memory was 179.3MB in the beginning and 647.0MB in the end (delta: 467.7MB). Free memory was 145.0MB in the beginning and 184.9MB in the end (delta: -39.9MB). Peak memory consumption was 510.3MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,614 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:42:42,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.34ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 130.3MB in the end (delta: 14.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.52ms. Allocated memory is still 179.3MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,614 INFO L158 Benchmark]: Boogie Preprocessor took 31.06ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,615 INFO L158 Benchmark]: RCFGBuilder took 838.34ms. Allocated memory is still 179.3MB. Free memory was 125.6MB in the beginning and 75.8MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,615 INFO L158 Benchmark]: TraceAbstraction took 571860.36ms. Allocated memory was 179.3MB in the beginning and 647.0MB in the end (delta: 467.7MB). Free memory was 75.2MB in the beginning and 184.9MB in the end (delta: -109.7MB). Peak memory consumption was 441.1MB. Max. memory is 8.0GB. [2022-12-06 02:42:42,617 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.34ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 130.3MB in the end (delta: 14.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.52ms. Allocated memory is still 179.3MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.06ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 838.34ms. Allocated memory is still 179.3MB. Free memory was 125.6MB in the beginning and 75.8MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 571860.36ms. Allocated memory was 179.3MB in the beginning and 647.0MB in the end (delta: 467.7MB). Free memory was 75.2MB in the beginning and 184.9MB in the end (delta: -109.7MB). Peak memory consumption was 441.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 212 PlacesBefore, 34 PlacesAfterwards, 221 TransitionsBefore, 30 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 27 ConcurrentYvCompositions, 13 ChoiceCompositions, 191 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 704, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 734, independent: 704, independent conditional: 0, independent unconditional: 704, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 644, independent: 625, independent conditional: 0, independent unconditional: 625, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 644, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 734, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 644, unknown conditional: 0, unknown unconditional: 644] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 931, Positive conditional cache size: 0, Positive unconditional cache size: 931, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 36 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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: 3.9s, 39 PlacesBefore, 38 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 40 PlacesBefore, 40 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 46 PlacesBefore, 46 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 49 PlacesAfterwards, 202 TransitionsBefore, 202 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 58 PlacesBefore, 57 PlacesAfterwards, 303 TransitionsBefore, 302 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 527 TransitionsBefore, 527 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 28 out of bounds for length 28 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 28 out of bounds for length 28: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 02:42:42,851 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 02:42:42,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...