/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:26:42,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:26:42,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:26:43,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:26:43,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:26:43,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:26:43,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:26:43,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:26:43,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:26:43,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:26:43,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:26:43,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:26:43,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:26:43,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:26:43,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:26:43,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:26:43,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:26:43,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:26:43,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:26:43,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:26:43,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:26:43,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:26:43,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:26:43,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:26:43,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:26:43,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:26:43,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:26:43,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:26:43,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:26:43,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:26:43,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:26:43,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:26:43,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:26:43,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:26:43,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:26:43,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:26:43,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:26:43,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:26:43,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:26:43,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:26:43,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:26:43,061 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:26:43,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:26:43,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:26:43,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:26:43,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:26:43,087 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:26:43,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:26:43,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:26:43,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:26:43,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:26:43,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:26:43,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:26:43,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:26:43,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:26:43,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:26:43,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:26:43,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:26:43,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:26:43,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:26:43,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:26:43,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:26:43,348 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:26:43,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-06 05:26:44,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:26:44,497 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:26:44,497 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-06 05:26:44,503 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84663a62e/c4e54b16d50c4b659a060255931aeda5/FLAG9b2fd6ffb [2022-12-06 05:26:44,512 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84663a62e/c4e54b16d50c4b659a060255931aeda5 [2022-12-06 05:26:44,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:26:44,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:26:44,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:26:44,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:26:44,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:26:44,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c42636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44, skipping insertion in model container [2022-12-06 05:26:44,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:26:44,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:26:44,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,693 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-2.wvr.c[5846,5859] [2022-12-06 05:26:44,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:26:44,710 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:26:44,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:26:44,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:26:44,752 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-2.wvr.c[5846,5859] [2022-12-06 05:26:44,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:26:44,768 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:26:44,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44 WrapperNode [2022-12-06 05:26:44,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:26:44,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:26:44,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:26:44,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:26:44,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,841 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-06 05:26:44,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:26:44,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:26:44,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:26:44,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:26:44,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,883 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:26:44,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:26:44,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:26:44,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:26:44,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (1/1) ... [2022-12-06 05:26:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:26:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:26:44,917 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 05:26:44,951 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 05:26:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:26:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:26:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:26:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:26:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:26:44,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:26:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:26:44,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:26:44,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:26:44,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:26:44,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:26:44,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:26:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:26:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:26:44,969 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 05:26:45,116 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:26:45,118 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:26:45,531 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:26:45,763 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:26:45,764 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 05:26:45,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:26:45 BoogieIcfgContainer [2022-12-06 05:26:45,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:26:45,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:26:45,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:26:45,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:26:45,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:26:44" (1/3) ... [2022-12-06 05:26:45,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e5eb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:26:45, skipping insertion in model container [2022-12-06 05:26:45,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:26:44" (2/3) ... [2022-12-06 05:26:45,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e5eb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:26:45, skipping insertion in model container [2022-12-06 05:26:45,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:26:45" (3/3) ... [2022-12-06 05:26:45,772 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-06 05:26:45,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:26:45,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:26:45,784 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:26:45,866 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 05:26:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-06 05:26:46,009 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-06 05:26:46,009 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:26:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 299 events. 25/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-06 05:26:46,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-06 05:26:46,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-06 05:26:46,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:46,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-06 05:26:46,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 287 transitions, 598 flow [2022-12-06 05:26:46,117 INFO L130 PetriNetUnfolder]: 25/287 cut-off events. [2022-12-06 05:26:46,117 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:26:46,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 287 events. 25/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-06 05:26:46,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-06 05:26:46,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 2544 [2022-12-06 05:26:57,363 INFO L203 LiptonReduction]: Total number of compositions: 246 [2022-12-06 05:26:57,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:26:57,388 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;@c4e11b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:26:57,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 05:26:57,394 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 05:26:57,394 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:26:57,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:57,395 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 05:26:57,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:26:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 13481392, now seen corresponding path program 1 times [2022-12-06 05:26:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:57,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179802918] [2022-12-06 05:26:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:57,977 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 05:26:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:57,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179802918] [2022-12-06 05:26:57,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179802918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:57,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:57,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:26:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202489263] [2022-12-06 05:26:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:57,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:26:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:26:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:26:58,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:26:58,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 106 flow. Second operand has 3 states, 2 states have (on average 12.5) 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 05:26:58,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:58,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:26:58,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:58,439 INFO L130 PetriNetUnfolder]: 2346/3110 cut-off events. [2022-12-06 05:26:58,439 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-06 05:26:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 3110 events. 2346/3110 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11907 event pairs, 381 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 5552. Up to 2810 conditions per place. [2022-12-06 05:26:58,458 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2022-12-06 05:26:58,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 301 flow [2022-12-06 05:26:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:26:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:26:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-06 05:26:58,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2022-12-06 05:26:58,470 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 106 flow. Second operand 3 states and 65 transitions. [2022-12-06 05:26:58,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 301 flow [2022-12-06 05:26:58,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 271 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 05:26:58,480 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2022-12-06 05:26:58,484 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-06 05:26:58,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:58,485 INFO L89 Accepts]: Start accepts. Operand has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:58,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:58,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,504 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2022-12-06 05:26:58,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:26:58,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 130 events. 58/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 6 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 154. Up to 60 conditions per place. [2022-12-06 05:26:58,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-06 05:26:58,573 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:58,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 05:26:58,574 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 123 flow [2022-12-06 05:26:58,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) 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 05:26:58,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:58,575 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 05:26:58,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:26:58,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:26:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1846233153, now seen corresponding path program 1 times [2022-12-06 05:26:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:58,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57849069] [2022-12-06 05:26:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:58,689 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 05:26:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57849069] [2022-12-06 05:26:58,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57849069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:58,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:58,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:26:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991248842] [2022-12-06 05:26:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:58,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:26:58,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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 05:26:58,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:58,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:26:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:59,170 INFO L130 PetriNetUnfolder]: 2945/4072 cut-off events. [2022-12-06 05:26:59,170 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2022-12-06 05:26:59,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9618 conditions, 4072 events. 2945/4072 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16331 event pairs, 2098 based on Foata normal form. 332/4211 useless extension candidates. Maximal degree in co-relation 3795. Up to 3111 conditions per place. [2022-12-06 05:26:59,183 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 44 selfloop transitions, 2 changer transitions 59/105 dead transitions. [2022-12-06 05:26:59,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 489 flow [2022-12-06 05:26:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:26:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:26:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 05:26:59,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2022-12-06 05:26:59,185 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 123 flow. Second operand 5 states and 105 transitions. [2022-12-06 05:26:59,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 489 flow [2022-12-06 05:26:59,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 105 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:26:59,188 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 160 flow [2022-12-06 05:26:59,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-06 05:26:59,188 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-06 05:26:59,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:59,189 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 160 flow [2022-12-06 05:26:59,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:59,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:59,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 160 flow [2022-12-06 05:26:59,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 160 flow [2022-12-06 05:26:59,200 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][35], [260#L105true, Black: 303#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), Black: 301#(<= ~manager_size~0 0), Black: 300#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 298#true, 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true]) [2022-12-06 05:26:59,200 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 05:26:59,200 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:26:59,201 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 05:26:59,201 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 05:26:59,202 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][35], [260#L105true, Black: 303#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), Black: 301#(<= ~manager_size~0 0), Black: 300#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 298#true, 162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 275#L87true, 87#L179-4true]) [2022-12-06 05:26:59,202 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 05:26:59,202 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:26:59,202 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:26:59,202 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 05:26:59,209 INFO L130 PetriNetUnfolder]: 93/187 cut-off events. [2022-12-06 05:26:59,209 INFO L131 PetriNetUnfolder]: For 101/139 co-relation queries the response was YES. [2022-12-06 05:26:59,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 187 events. 93/187 cut-off events. For 101/139 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 11 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 407. Up to 76 conditions per place. [2022-12-06 05:26:59,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 160 flow [2022-12-06 05:26:59,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 05:27:00,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:00,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1654 [2022-12-06 05:27:00,842 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 156 flow [2022-12-06 05:27:00,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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 05:27:00,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:00,842 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 05:27:00,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:27:00,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 928199408, now seen corresponding path program 1 times [2022-12-06 05:27:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:00,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811810170] [2022-12-06 05:27:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:01,044 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 05:27:01,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:01,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811810170] [2022-12-06 05:27:01,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811810170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:01,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:01,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091144232] [2022-12-06 05:27:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:01,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:01,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:01,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:01,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:01,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:01,454 INFO L130 PetriNetUnfolder]: 2852/3828 cut-off events. [2022-12-06 05:27:01,454 INFO L131 PetriNetUnfolder]: For 2964/2964 co-relation queries the response was YES. [2022-12-06 05:27:01,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10438 conditions, 3828 events. 2852/3828 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14642 event pairs, 765 based on Foata normal form. 140/3967 useless extension candidates. Maximal degree in co-relation 10426. Up to 2698 conditions per place. [2022-12-06 05:27:01,470 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-06 05:27:01,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 367 flow [2022-12-06 05:27:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 05:27:01,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2022-12-06 05:27:01,473 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 156 flow. Second operand 3 states and 67 transitions. [2022-12-06 05:27:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 367 flow [2022-12-06 05:27:01,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 349 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 05:27:01,477 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 05:27:01,479 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-06 05:27:01,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:01,479 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:01,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:01,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,497 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][34], [Black: 303#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 0)), 260#L105true, Black: 301#(<= ~manager_size~0 0), 162#L123true, Black: 309#(= ~node1_front~0 ~node1_back~0), 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, 307#true]) [2022-12-06 05:27:01,497 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:27:01,497 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:27:01,497 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:01,497 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:01,502 INFO L130 PetriNetUnfolder]: 97/215 cut-off events. [2022-12-06 05:27:01,502 INFO L131 PetriNetUnfolder]: For 126/154 co-relation queries the response was YES. [2022-12-06 05:27:01,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 215 events. 97/215 cut-off events. For 126/154 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 811 event pairs, 29 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 412. Up to 83 conditions per place. [2022-12-06 05:27:01,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 05:27:01,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:01,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 05:27:01,506 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 146 flow [2022-12-06 05:27:01,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:01,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:01,506 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 05:27:01,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:27:01,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1651102280, now seen corresponding path program 1 times [2022-12-06 05:27:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:01,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321186361] [2022-12-06 05:27:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:01,653 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 05:27:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:01,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321186361] [2022-12-06 05:27:01,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321186361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:01,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:01,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367049384] [2022-12-06 05:27:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:01,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:01,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:01,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:01,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:01,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:01,981 INFO L130 PetriNetUnfolder]: 2676/3626 cut-off events. [2022-12-06 05:27:01,981 INFO L131 PetriNetUnfolder]: For 2936/2936 co-relation queries the response was YES. [2022-12-06 05:27:01,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 3626 events. 2676/3626 cut-off events. For 2936/2936 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13727 event pairs, 689 based on Foata normal form. 132/3754 useless extension candidates. Maximal degree in co-relation 8028. Up to 2700 conditions per place. [2022-12-06 05:27:01,999 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-06 05:27:01,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 359 flow [2022-12-06 05:27:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 05:27:02,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2022-12-06 05:27:02,002 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 146 flow. Second operand 3 states and 68 transitions. [2022-12-06 05:27:02,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 359 flow [2022-12-06 05:27:02,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 341 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:27:02,007 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 05:27:02,009 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-06 05:27:02,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:02,009 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:02,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:02,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,029 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][31], [260#L105true, Black: 301#(<= ~manager_size~0 0), 162#L123true, Black: 309#(= ~node1_front~0 ~node1_back~0), 104#L135true, Black: 296#(= ~safe~0 1), Black: 313#(= ~node2_back~0 ~node2_front~0), 151#L57true, 87#L179-4true, 311#true]) [2022-12-06 05:27:02,029 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,029 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,029 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,029 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:27:02,036 INFO L130 PetriNetUnfolder]: 100/229 cut-off events. [2022-12-06 05:27:02,036 INFO L131 PetriNetUnfolder]: For 72/73 co-relation queries the response was YES. [2022-12-06 05:27:02,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 229 events. 100/229 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 853 event pairs, 33 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 397. Up to 86 conditions per place. [2022-12-06 05:27:02,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 05:27:02,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:02,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 05:27:02,079 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 142 flow [2022-12-06 05:27:02,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:02,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:02,080 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 05:27:02,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:27:02,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 259568521, now seen corresponding path program 1 times [2022-12-06 05:27:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:02,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348033575] [2022-12-06 05:27:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:02,224 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 05:27:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348033575] [2022-12-06 05:27:02,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348033575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:02,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:02,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626656348] [2022-12-06 05:27:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:02,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:02,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:02,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:02,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:02,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:02,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:02,609 INFO L130 PetriNetUnfolder]: 3151/4249 cut-off events. [2022-12-06 05:27:02,609 INFO L131 PetriNetUnfolder]: For 2452/2452 co-relation queries the response was YES. [2022-12-06 05:27:02,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11305 conditions, 4249 events. 3151/4249 cut-off events. For 2452/2452 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15868 event pairs, 896 based on Foata normal form. 104/4349 useless extension candidates. Maximal degree in co-relation 9537. Up to 2724 conditions per place. [2022-12-06 05:27:02,629 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 60 selfloop transitions, 2 changer transitions 8/70 dead transitions. [2022-12-06 05:27:02,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 351 flow [2022-12-06 05:27:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-06 05:27:02,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2022-12-06 05:27:02,630 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 142 flow. Second operand 3 states and 71 transitions. [2022-12-06 05:27:02,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 351 flow [2022-12-06 05:27:02,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:02,633 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-06 05:27:02,634 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-06 05:27:02,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:02,635 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:02,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:02,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,650 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][31], [260#L105true, Black: 301#(<= ~manager_size~0 0), 162#L123true, Black: 309#(= ~node1_front~0 ~node1_back~0), 104#L135true, 315#true, Black: 296#(= ~safe~0 1), Black: 313#(= ~node2_back~0 ~node2_front~0), 151#L57true, 87#L179-4true, Black: 317#(<= ~client_back~0 ~client_front~0)]) [2022-12-06 05:27:02,650 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,650 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,650 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 05:27:02,650 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:27:02,661 INFO L130 PetriNetUnfolder]: 120/259 cut-off events. [2022-12-06 05:27:02,661 INFO L131 PetriNetUnfolder]: For 96/97 co-relation queries the response was YES. [2022-12-06 05:27:02,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 259 events. 120/259 cut-off events. For 96/97 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 976 event pairs, 43 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 485. Up to 98 conditions per place. [2022-12-06 05:27:02,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:27:02,664 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:02,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:27:02,666 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 148 flow [2022-12-06 05:27:02,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 05:27:02,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:02,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:27:02,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1810557708, now seen corresponding path program 1 times [2022-12-06 05:27:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:02,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208011185] [2022-12-06 05:27:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:02,801 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 05:27:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:02,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208011185] [2022-12-06 05:27:02,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208011185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:02,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:02,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163127035] [2022-12-06 05:27:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:02,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:02,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:02,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:02,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:02,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:03,507 INFO L130 PetriNetUnfolder]: 5282/7293 cut-off events. [2022-12-06 05:27:03,507 INFO L131 PetriNetUnfolder]: For 4496/4496 co-relation queries the response was YES. [2022-12-06 05:27:03,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19429 conditions, 7293 events. 5282/7293 cut-off events. For 4496/4496 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 31388 event pairs, 4147 based on Foata normal form. 160/7444 useless extension candidates. Maximal degree in co-relation 11685. Up to 4248 conditions per place. [2022-12-06 05:27:03,526 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 3 changer transitions 67/113 dead transitions. [2022-12-06 05:27:03,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 570 flow [2022-12-06 05:27:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:27:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:27:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 05:27:03,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2022-12-06 05:27:03,529 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 148 flow. Second operand 5 states and 111 transitions. [2022-12-06 05:27:03,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 570 flow [2022-12-06 05:27:03,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:03,533 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 172 flow [2022-12-06 05:27:03,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-06 05:27:03,535 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-06 05:27:03,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:03,535 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 172 flow [2022-12-06 05:27:03,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:03,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:03,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 172 flow [2022-12-06 05:27:03,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 172 flow [2022-12-06 05:27:03,554 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][29], [319#true, Black: 322#(<= ~client_size~0 0), 162#L123true, Black: 324#(and (<= ~client_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~client_size~0 0)), Black: 321#(and (<= ~client_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, 260#L105true, Black: 301#(<= ~manager_size~0 0), Black: 309#(= ~node1_front~0 ~node1_back~0), Black: 313#(= ~node2_back~0 ~node2_front~0), Black: 317#(<= ~client_back~0 ~client_front~0)]) [2022-12-06 05:27:03,554 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 05:27:03,554 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:03,554 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:03,554 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:27:03,568 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 05:27:03,568 INFO L131 PetriNetUnfolder]: For 102/103 co-relation queries the response was YES. [2022-12-06 05:27:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 260 events. 120/260 cut-off events. For 102/103 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 973 event pairs, 43 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 540. Up to 98 conditions per place. [2022-12-06 05:27:03,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 172 flow [2022-12-06 05:27:03,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:27:03,930 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:03,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-06 05:27:03,931 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 168 flow [2022-12-06 05:27:03,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:03,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:03,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:03,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:27:03,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 826560604, now seen corresponding path program 1 times [2022-12-06 05:27:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:03,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232418810] [2022-12-06 05:27:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:04,037 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 05:27:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:04,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232418810] [2022-12-06 05:27:04,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232418810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:04,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:04,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702170390] [2022-12-06 05:27:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:04,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:04,039 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:04,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:04,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:04,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:04,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:04,616 INFO L130 PetriNetUnfolder]: 3650/5067 cut-off events. [2022-12-06 05:27:04,616 INFO L131 PetriNetUnfolder]: For 3518/3518 co-relation queries the response was YES. [2022-12-06 05:27:04,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13647 conditions, 5067 events. 3650/5067 cut-off events. For 3518/3518 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 20580 event pairs, 2853 based on Foata normal form. 76/5142 useless extension candidates. Maximal degree in co-relation 13622. Up to 4246 conditions per place. [2022-12-06 05:27:04,636 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 43 selfloop transitions, 3 changer transitions 47/93 dead transitions. [2022-12-06 05:27:04,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 486 flow [2022-12-06 05:27:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:27:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:27:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 05:27:04,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2022-12-06 05:27:04,637 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 168 flow. Second operand 5 states and 91 transitions. [2022-12-06 05:27:04,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 486 flow [2022-12-06 05:27:04,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 456 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 05:27:04,643 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 168 flow [2022-12-06 05:27:04,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-06 05:27:04,643 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-06 05:27:04,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:04,643 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 168 flow [2022-12-06 05:27:04,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:04,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:04,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 168 flow [2022-12-06 05:27:04,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 168 flow [2022-12-06 05:27:04,657 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][30], [162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 328#true, 151#L57true, 87#L179-4true, Black: 330#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node1_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 331#(<= ~node1_size~0 0), 260#L105true, Black: 333#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node1_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~node1_size~0 0)), Black: 301#(<= ~manager_size~0 0), Black: 309#(= ~node1_front~0 ~node1_back~0), Black: 313#(= ~node2_back~0 ~node2_front~0), Black: 317#(<= ~client_back~0 ~client_front~0)]) [2022-12-06 05:27:04,658 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 05:27:04,658 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:04,658 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:04,658 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:27:04,669 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 05:27:04,670 INFO L131 PetriNetUnfolder]: For 103/104 co-relation queries the response was YES. [2022-12-06 05:27:04,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 260 events. 120/260 cut-off events. For 103/104 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 976 event pairs, 43 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 536. Up to 98 conditions per place. [2022-12-06 05:27:04,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 168 flow [2022-12-06 05:27:04,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:27:05,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:05,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-06 05:27:05,049 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 164 flow [2022-12-06 05:27:05,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:05,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:05,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:05,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:27:05,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 690203490, now seen corresponding path program 1 times [2022-12-06 05:27:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:05,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575102911] [2022-12-06 05:27:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:05,179 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 05:27:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:05,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575102911] [2022-12-06 05:27:05,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575102911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:05,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:05,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894972136] [2022-12-06 05:27:05,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:05,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:05,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:05,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:05,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:05,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:05,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:05,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:05,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:05,602 INFO L130 PetriNetUnfolder]: 3522/4835 cut-off events. [2022-12-06 05:27:05,603 INFO L131 PetriNetUnfolder]: For 3477/3477 co-relation queries the response was YES. [2022-12-06 05:27:05,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13148 conditions, 4835 events. 3522/4835 cut-off events. For 3477/3477 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 18919 event pairs, 2708 based on Foata normal form. 56/4889 useless extension candidates. Maximal degree in co-relation 13119. Up to 4244 conditions per place. [2022-12-06 05:27:05,616 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 43 selfloop transitions, 3 changer transitions 25/71 dead transitions. [2022-12-06 05:27:05,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 386 flow [2022-12-06 05:27:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:27:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:27:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 05:27:05,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2022-12-06 05:27:05,618 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 164 flow. Second operand 5 states and 68 transitions. [2022-12-06 05:27:05,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 386 flow [2022-12-06 05:27:05,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 362 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 05:27:05,621 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 162 flow [2022-12-06 05:27:05,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 05:27:05,622 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-06 05:27:05,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:05,622 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 162 flow [2022-12-06 05:27:05,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:05,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:05,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 162 flow [2022-12-06 05:27:05,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 162 flow [2022-12-06 05:27:05,636 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1383] L141-->L135: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_221| v_~manager~0.base_89) (+ (* v_~manager_back~0_141 4) v_~manager~0.offset_89)) v_~update~0_73) 1 0)) (= v_~manager_back~0_140 (+ v_~manager_back~0_141 1)) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet29#1_22| 256) 0)) (not (= (ite (and (<= 0 v_~manager_back~0_141) (< v_~manager_back~0_141 v_~manager_size~0_66)) 1 0) 0)) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) InVars {~manager~0.offset=v_~manager~0.offset_89, ~manager~0.base=v_~manager~0.base_89, #memory_int=|v_#memory_int_221|, ~manager_back~0=v_~manager_back~0_141, ~manager_size~0=v_~manager_size~0_66, thread4Thread1of1ForFork2_#t~nondet29#1=|v_thread4Thread1of1ForFork2_#t~nondet29#1_22|, ~update~0=v_~update~0_73} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~manager~0.offset=v_~manager~0.offset_89, thread4Thread1of1ForFork2_#t~post31#1=|v_thread4Thread1of1ForFork2_#t~post31#1_5|, ~manager~0.base=v_~manager~0.base_89, thread4Thread1of1ForFork2_#t~mem30#1=|v_thread4Thread1of1ForFork2_#t~mem30#1_5|, #memory_int=|v_#memory_int_221|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, ~manager_back~0=v_~manager_back~0_140, ~manager_size~0=v_~manager_size~0_66, ~update~0=v_~update~0_73} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post31#1, thread4Thread1of1ForFork2_#t~mem30#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, thread4Thread1of1ForFork2_#t~nondet29#1][29], [162#L123true, 104#L135true, Black: 296#(= ~safe~0 1), 151#L57true, 87#L179-4true, 260#L105true, Black: 301#(<= ~manager_size~0 0), 337#true, Black: 309#(= ~node1_front~0 ~node1_back~0), Black: 339#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node2_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 342#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node2_size~0 0) (<= ~node2_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 313#(= ~node2_back~0 ~node2_front~0), Black: 317#(<= ~client_back~0 ~client_front~0)]) [2022-12-06 05:27:05,636 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 05:27:05,637 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:05,637 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 05:27:05,637 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 05:27:05,647 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 05:27:05,647 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-12-06 05:27:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 260 events. 120/260 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 972 event pairs, 43 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 531. Up to 98 conditions per place. [2022-12-06 05:27:05,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 162 flow [2022-12-06 05:27:05,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 05:27:05,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:05,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-06 05:27:05,968 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 158 flow [2022-12-06 05:27:05,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 05:27:05,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:05,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:05,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:27:05,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash -583479235, now seen corresponding path program 1 times [2022-12-06 05:27:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:05,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406117646] [2022-12-06 05:27:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:06,142 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 05:27:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406117646] [2022-12-06 05:27:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406117646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:06,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:06,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:27:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146846933] [2022-12-06 05:27:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:06,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:27:06,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:27:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:27:06,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:06,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 05:27:06,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:06,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:06,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:06,421 INFO L130 PetriNetUnfolder]: 1883/2539 cut-off events. [2022-12-06 05:27:06,421 INFO L131 PetriNetUnfolder]: For 1870/1870 co-relation queries the response was YES. [2022-12-06 05:27:06,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 2539 events. 1883/2539 cut-off events. For 1870/1870 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8403 event pairs, 709 based on Foata normal form. 30/2566 useless extension candidates. Maximal degree in co-relation 6906. Up to 2325 conditions per place. [2022-12-06 05:27:06,431 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 47 selfloop transitions, 2 changer transitions 9/58 dead transitions. [2022-12-06 05:27:06,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 306 flow [2022-12-06 05:27:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:27:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:27:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 05:27:06,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2022-12-06 05:27:06,432 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 158 flow. Second operand 3 states and 55 transitions. [2022-12-06 05:27:06,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 306 flow [2022-12-06 05:27:06,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 294 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:27:06,434 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 160 flow [2022-12-06 05:27:06,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-06 05:27:06,434 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-06 05:27:06,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:06,434 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 160 flow [2022-12-06 05:27:06,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:06,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:06,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-06 05:27:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 160 flow [2022-12-06 05:27:06,454 INFO L130 PetriNetUnfolder]: 65/151 cut-off events. [2022-12-06 05:27:06,454 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 05:27:06,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 151 events. 65/151 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 399 event pairs, 27 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 293. Up to 57 conditions per place. [2022-12-06 05:27:06,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-06 05:27:06,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 05:27:07,746 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:27:07,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1313 [2022-12-06 05:27:07,747 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 158 flow [2022-12-06 05:27:07,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 05:27:07,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:07,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:27:07,747 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -540429184, now seen corresponding path program 1 times [2022-12-06 05:27:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:07,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525324563] [2022-12-06 05:27:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:07,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:07,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525324563] [2022-12-06 05:27:07,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525324563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:07,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:07,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451346391] [2022-12-06 05:27:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:07,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:07,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:27:07,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 05:27:07,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:07,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:27:07,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:08,229 INFO L130 PetriNetUnfolder]: 2142/3049 cut-off events. [2022-12-06 05:27:08,229 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-12-06 05:27:08,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8338 conditions, 3049 events. 2142/3049 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11666 event pairs, 1627 based on Foata normal form. 72/3110 useless extension candidates. Maximal degree in co-relation 3203. Up to 2234 conditions per place. [2022-12-06 05:27:08,237 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 44 selfloop transitions, 2 changer transitions 67/113 dead transitions. [2022-12-06 05:27:08,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 113 transitions, 590 flow [2022-12-06 05:27:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:27:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:27:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-06 05:27:08,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2022-12-06 05:27:08,238 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 158 flow. Second operand 5 states and 113 transitions. [2022-12-06 05:27:08,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 113 transitions, 590 flow [2022-12-06 05:27:08,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 580 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:27:08,240 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 184 flow [2022-12-06 05:27:08,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-12-06 05:27:08,241 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-06 05:27:08,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:08,241 INFO L89 Accepts]: Start accepts. Operand has 55 places, 46 transitions, 184 flow [2022-12-06 05:27:08,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:08,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:08,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 46 transitions, 184 flow [2022-12-06 05:27:08,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 184 flow [2022-12-06 05:27:08,256 INFO L130 PetriNetUnfolder]: 65/149 cut-off events. [2022-12-06 05:27:08,256 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 05:27:08,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 149 events. 65/149 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 407 event pairs, 27 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 328. Up to 57 conditions per place. [2022-12-06 05:27:08,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 184 flow [2022-12-06 05:27:08,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 05:27:10,618 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:27:10,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2378 [2022-12-06 05:27:10,619 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2022-12-06 05:27:10,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 05:27:10,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:10,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:10,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:27:10,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -82120250, now seen corresponding path program 1 times [2022-12-06 05:27:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190188678] [2022-12-06 05:27:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:10,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190188678] [2022-12-06 05:27:10,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190188678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:10,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:10,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:27:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467924895] [2022-12-06 05:27:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:10,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:27:10,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 05:27:10,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:10,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:27:10,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:10,968 INFO L130 PetriNetUnfolder]: 1517/2089 cut-off events. [2022-12-06 05:27:10,968 INFO L131 PetriNetUnfolder]: For 2007/2007 co-relation queries the response was YES. [2022-12-06 05:27:10,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 2089 events. 1517/2089 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6700 event pairs, 524 based on Foata normal form. 36/2124 useless extension candidates. Maximal degree in co-relation 6003. Up to 1615 conditions per place. [2022-12-06 05:27:10,976 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 53 selfloop transitions, 7 changer transitions 16/76 dead transitions. [2022-12-06 05:27:10,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 429 flow [2022-12-06 05:27:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 05:27:10,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-06 05:27:10,977 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 4 states and 77 transitions. [2022-12-06 05:27:10,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 429 flow [2022-12-06 05:27:10,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 401 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 05:27:10,979 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:10,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-06 05:27:10,980 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-06 05:27:10,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:10,980 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:10,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:10,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:10,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:10,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:11,000 INFO L130 PetriNetUnfolder]: 70/180 cut-off events. [2022-12-06 05:27:11,000 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 05:27:11,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 180 events. 70/180 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 534 event pairs, 26 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 367. Up to 64 conditions per place. [2022-12-06 05:27:11,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:11,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 05:27:11,002 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:11,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:27:11,002 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 199 flow [2022-12-06 05:27:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 05:27:11,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:11,002 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1] [2022-12-06 05:27:11,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:27:11,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 347761394, now seen corresponding path program 1 times [2022-12-06 05:27:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:11,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403348267] [2022-12-06 05:27:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:11,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:11,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403348267] [2022-12-06 05:27:11,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403348267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:11,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:11,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:27:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127438978] [2022-12-06 05:27:11,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:11,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:27:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:27:11,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:27:11,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:27:11,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:11,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:11,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:27:11,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:11,558 INFO L130 PetriNetUnfolder]: 1799/2563 cut-off events. [2022-12-06 05:27:11,558 INFO L131 PetriNetUnfolder]: For 2541/2541 co-relation queries the response was YES. [2022-12-06 05:27:11,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 2563 events. 1799/2563 cut-off events. For 2541/2541 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9324 event pairs, 1216 based on Foata normal form. 16/2571 useless extension candidates. Maximal degree in co-relation 2776. Up to 2090 conditions per place. [2022-12-06 05:27:11,565 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 47 selfloop transitions, 2 changer transitions 50/99 dead transitions. [2022-12-06 05:27:11,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 558 flow [2022-12-06 05:27:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:27:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:27:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 05:27:11,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-06 05:27:11,566 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 199 flow. Second operand 6 states and 93 transitions. [2022-12-06 05:27:11,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 558 flow [2022-12-06 05:27:11,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 542 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 05:27:11,569 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 211 flow [2022-12-06 05:27:11,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2022-12-06 05:27:11,569 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-06 05:27:11,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:11,569 INFO L89 Accepts]: Start accepts. Operand has 61 places, 49 transitions, 211 flow [2022-12-06 05:27:11,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:11,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:11,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 211 flow [2022-12-06 05:27:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 211 flow [2022-12-06 05:27:11,589 INFO L130 PetriNetUnfolder]: 71/181 cut-off events. [2022-12-06 05:27:11,590 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-06 05:27:11,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 181 events. 71/181 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 526 event pairs, 26 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 413. Up to 64 conditions per place. [2022-12-06 05:27:11,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 211 flow [2022-12-06 05:27:11,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 05:27:13,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:13,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1861 [2022-12-06 05:27:13,430 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 207 flow [2022-12-06 05:27:13,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:13,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:13,431 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1] [2022-12-06 05:27:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:27:13,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -294946541, now seen corresponding path program 1 times [2022-12-06 05:27:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578189732] [2022-12-06 05:27:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:13,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578189732] [2022-12-06 05:27:13,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578189732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:27:13,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179199831] [2022-12-06 05:27:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:13,764 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 05:27:13,766 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 05:27:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:13,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:27:13,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:27:14,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:27:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179199831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:14,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:27:14,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-06 05:27:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389325582] [2022-12-06 05:27:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:14,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:27:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:27:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:27:14,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:27:14,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:14,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:14,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:27:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:14,626 INFO L130 PetriNetUnfolder]: 2746/3991 cut-off events. [2022-12-06 05:27:14,626 INFO L131 PetriNetUnfolder]: For 4848/4848 co-relation queries the response was YES. [2022-12-06 05:27:14,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11810 conditions, 3991 events. 2746/3991 cut-off events. For 4848/4848 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16557 event pairs, 1729 based on Foata normal form. 268/4250 useless extension candidates. Maximal degree in co-relation 11784. Up to 2088 conditions per place. [2022-12-06 05:27:14,637 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 46 selfloop transitions, 3 changer transitions 107/156 dead transitions. [2022-12-06 05:27:14,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 156 transitions, 929 flow [2022-12-06 05:27:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:27:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:27:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-06 05:27:14,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 05:27:14,638 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 207 flow. Second operand 7 states and 144 transitions. [2022-12-06 05:27:14,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 156 transitions, 929 flow [2022-12-06 05:27:14,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 156 transitions, 891 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 05:27:14,643 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 223 flow [2022-12-06 05:27:14,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-06 05:27:14,644 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-06 05:27:14,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:14,644 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 223 flow [2022-12-06 05:27:14,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:14,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:14,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 223 flow [2022-12-06 05:27:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 223 flow [2022-12-06 05:27:14,664 INFO L130 PetriNetUnfolder]: 71/181 cut-off events. [2022-12-06 05:27:14,664 INFO L131 PetriNetUnfolder]: For 183/199 co-relation queries the response was YES. [2022-12-06 05:27:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 181 events. 71/181 cut-off events. For 183/199 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 531 event pairs, 26 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 448. Up to 64 conditions per place. [2022-12-06 05:27:14,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 223 flow [2022-12-06 05:27:14,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 05:27:15,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:15,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-06 05:27:15,064 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 219 flow [2022-12-06 05:27:15,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:15,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:15,065 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1] [2022-12-06 05:27:15,070 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 05:27:15,265 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,SelfDestructingSolverStorable12 [2022-12-06 05:27:15,266 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 344546858, now seen corresponding path program 1 times [2022-12-06 05:27:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:15,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106949400] [2022-12-06 05:27:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:15,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106949400] [2022-12-06 05:27:15,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106949400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:27:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752332767] [2022-12-06 05:27:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:15,552 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 05:27:15,554 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 05:27:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:15,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:27:15,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:15,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:27:15,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752332767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:15,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:27:15,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-06 05:27:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650102217] [2022-12-06 05:27:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:15,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:27:15,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:27:15,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:15,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:15,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:27:15,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:16,250 INFO L130 PetriNetUnfolder]: 3707/4987 cut-off events. [2022-12-06 05:27:16,250 INFO L131 PetriNetUnfolder]: For 8396/8396 co-relation queries the response was YES. [2022-12-06 05:27:16,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16178 conditions, 4987 events. 3707/4987 cut-off events. For 8396/8396 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18951 event pairs, 1129 based on Foata normal form. 124/5110 useless extension candidates. Maximal degree in co-relation 16145. Up to 1931 conditions per place. [2022-12-06 05:27:16,266 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 92 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2022-12-06 05:27:16,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 622 flow [2022-12-06 05:27:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 05:27:16,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54375 [2022-12-06 05:27:16,267 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 219 flow. Second operand 4 states and 87 transitions. [2022-12-06 05:27:16,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 622 flow [2022-12-06 05:27:16,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 572 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-12-06 05:27:16,277 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-12-06 05:27:16,277 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-06 05:27:16,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:16,278 INFO L89 Accepts]: Start accepts. Operand has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:16,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:16,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,313 INFO L130 PetriNetUnfolder]: 161/359 cut-off events. [2022-12-06 05:27:16,313 INFO L131 PetriNetUnfolder]: For 326/328 co-relation queries the response was YES. [2022-12-06 05:27:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 359 events. 161/359 cut-off events. For 326/328 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1402 event pairs, 71 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 848. Up to 138 conditions per place. [2022-12-06 05:27:16,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 05:27:16,316 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:16,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 05:27:16,317 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 227 flow [2022-12-06 05:27:16,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:16,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:16,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:16,323 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 05:27:16,522 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,SelfDestructingSolverStorable13 [2022-12-06 05:27:16,523 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:27:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 499288996, now seen corresponding path program 1 times [2022-12-06 05:27:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344754865] [2022-12-06 05:27:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:21,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344754865] [2022-12-06 05:27:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344754865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:27:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612137086] [2022-12-06 05:27:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:27:21,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:27:21,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:27:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:22,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-06 05:27:22,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:27:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:23,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:27:42,852 WARN L233 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 1365 DAG size of output: 1308 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 05:27:42,860 INFO L321 Elim1Store]: treesize reduction 261, result has 95.7 percent of original size [2022-12-06 05:27:42,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 351 case distinctions, treesize of input 511 treesize of output 5854 Received shutdown request... [2022-12-06 05:40:49,848 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 05:40:49,860 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:40:49,860 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:40:49,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:40:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:40:50,049 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. [2022-12-06 05:40:50,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 05:40:50,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 05:40:50,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 05:40:50,051 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 05:40:50,052 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:40:50,054 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:40:50,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:40:50,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:40:50 BasicIcfg [2022-12-06 05:40:50,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:40:50,056 INFO L158 Benchmark]: Toolchain (without parser) took 845541.38ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 162.7MB in the beginning and 816.2MB in the end (delta: -653.5MB). Peak memory consumption was 761.8MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,056 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:40:50,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.93ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 146.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.88ms. Allocated memory is still 186.6MB. Free memory was 146.1MB in the beginning and 143.0MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,057 INFO L158 Benchmark]: Boogie Preprocessor took 49.98ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 140.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,057 INFO L158 Benchmark]: RCFGBuilder took 872.25ms. Allocated memory was 186.6MB in the beginning and 229.6MB in the end (delta: 43.0MB). Free memory was 140.4MB in the beginning and 187.4MB in the end (delta: -46.9MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,057 INFO L158 Benchmark]: TraceAbstraction took 844288.23ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 934.3MB). Free memory was 186.8MB in the beginning and 816.2MB in the end (delta: -629.4MB). Peak memory consumption was 742.8MB. Max. memory is 8.0GB. [2022-12-06 05:40:50,058 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.93ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 146.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.88ms. Allocated memory is still 186.6MB. Free memory was 146.1MB in the beginning and 143.0MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.98ms. Allocated memory is still 186.6MB. Free memory was 143.0MB in the beginning and 140.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 872.25ms. Allocated memory was 186.6MB in the beginning and 229.6MB in the end (delta: 43.0MB). Free memory was 140.4MB in the beginning and 187.4MB in the end (delta: -46.9MB). Peak memory consumption was 57.8MB. Max. memory is 8.0GB. * TraceAbstraction took 844288.23ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 934.3MB). Free memory was 186.8MB in the beginning and 816.2MB in the end (delta: -629.4MB). Peak memory consumption was 742.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 275 PlacesBefore, 46 PlacesAfterwards, 287 TransitionsBefore, 41 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 192 TrivialYvCompositions, 37 ConcurrentYvCompositions, 17 ChoiceCompositions, 246 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 1300, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1268, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1268, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1348, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 1891, Positive cache size: 1871, Positive conditional cache size: 0, Positive unconditional cache size: 1871, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 43, unknown conditional: 1, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 45 PlacesBefore, 44 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 2, independent unconditional: 92, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 94, independent conditional: 2, independent unconditional: 92, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 94, independent conditional: 2, independent unconditional: 92, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 82, independent conditional: 1, independent unconditional: 81, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 45, Positive conditional cache size: 1, Positive unconditional cache size: 44, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 35, independent conditional: 1, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 35, independent conditional: 1, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 35, independent conditional: 1, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 43, independent: 31, independent conditional: 1, independent unconditional: 30, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 49, Positive conditional cache size: 1, Positive unconditional cache size: 48, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 53 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, 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, 52 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 55, Positive conditional cache size: 1, Positive unconditional cache size: 54, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 50 PlacesBefore, 49 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 82, Positive conditional cache size: 1, Positive unconditional cache size: 81, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 53 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 85, Positive conditional cache size: 1, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, 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, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 322 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): 97, Positive cache size: 85, Positive conditional cache size: 1, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 58 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 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): 97, Positive cache size: 85, Positive conditional cache size: 1, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 60 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 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): 97, Positive cache size: 85, Positive conditional cache size: 1, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, 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, 57 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 374 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): 97, Positive cache size: 85, Positive conditional cache size: 1, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 1, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-311-6-4-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 319 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.2s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 622 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1598 IncrementalHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 0 mSDtfsCounter, 1598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 1205 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 40/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown