/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:11:22,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:11:22,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:11:22,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:11:22,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:11:22,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:11:22,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:11:22,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:11:22,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:11:22,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:11:22,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:11:22,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:11:22,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:11:22,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:11:22,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:11:22,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:11:22,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:11:22,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:11:22,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:11:22,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:11:22,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:11:22,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:11:22,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:11:22,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:11:22,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:11:22,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:11:22,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:11:22,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:11:22,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:11:22,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:11:22,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:11:22,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:11:22,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:11:22,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:11:22,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:11:22,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:11:22,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:11:22,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:11:22,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:11:22,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:11:22,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:11:22,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:11:22,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:11:22,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:11:22,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:11:22,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:11:22,102 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:11:22,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:11:22,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:11:22,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:11:22,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:11:22,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:11:22,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:11:22,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:11:22,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:11:22,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:11:22,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:11:22,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:11:22,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:11:22,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:11:22,524 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:11:22,528 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 00:11:23,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:11:23,652 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:11:23,653 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-06 00:11:23,660 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e089f8a/e3294abbc536499abb84b84d008b8d40/FLAGa19b1c8cd [2022-12-06 00:11:23,673 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e089f8a/e3294abbc536499abb84b84d008b8d40 [2022-12-06 00:11:23,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:11:23,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:11:23,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:11:23,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:11:23,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:11:23,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:23,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52844a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23, skipping insertion in model container [2022-12-06 00:11:23,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:23,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:11:23,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:11:23,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,903 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 00:11:23,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:11:23,924 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:11:23,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:11:23,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:11:23,966 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 00:11:23,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:11:23,982 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:11:23,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23 WrapperNode [2022-12-06 00:11:23,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:11:23,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:11:23,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:11:23,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:11:23,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,044 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-06 00:11:24,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:11:24,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:11:24,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:11:24,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:11:24,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,082 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:11:24,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:11:24,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:11:24,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:11:24,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (1/1) ... [2022-12-06 00:11:24,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:11:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:24,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:11:24,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:11:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:11:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:11:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:11:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:11:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:11:24,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:11:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:11:24,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:11:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:11:24,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:11:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 00:11:24,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:11:24,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:11:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:11:24,171 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:11:24,272 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:11:24,274 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:11:24,827 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:11:25,085 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:11:25,085 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 00:11:25,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:11:25 BoogieIcfgContainer [2022-12-06 00:11:25,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:11:25,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:11:25,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:11:25,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:11:25,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:11:23" (1/3) ... [2022-12-06 00:11:25,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53949b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:11:25, skipping insertion in model container [2022-12-06 00:11:25,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:11:23" (2/3) ... [2022-12-06 00:11:25,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53949b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:11:25, skipping insertion in model container [2022-12-06 00:11:25,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:11:25" (3/3) ... [2022-12-06 00:11:25,095 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-06 00:11:25,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:11:25,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:11:25,107 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:11:25,173 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 00:11:25,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-06 00:11:25,286 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-06 00:11:25,286 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:11:25,292 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 00:11:25,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-06 00:11:25,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-06 00:11:25,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:25,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-06 00:11:25,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 287 transitions, 598 flow [2022-12-06 00:11:25,373 INFO L130 PetriNetUnfolder]: 25/287 cut-off events. [2022-12-06 00:11:25,374 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:11:25,375 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 00:11:25,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-06 00:11:25,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 2544 [2022-12-06 00:11:36,227 INFO L203 LiptonReduction]: Total number of compositions: 246 [2022-12-06 00:11:36,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:11:36,249 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;@42e5d6ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:11:36,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 00:11:36,259 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 00:11:36,260 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:11:36,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:36,260 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 00:11:36,261 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 00:11:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 13481392, now seen corresponding path program 1 times [2022-12-06 00:11:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:36,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938538673] [2022-12-06 00:11:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938538673] [2022-12-06 00:11:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938538673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:36,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:36,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:11:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436764932] [2022-12-06 00:11:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:11:36,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:36,850 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 00:11:36,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:36,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:36,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:37,210 INFO L130 PetriNetUnfolder]: 2346/3110 cut-off events. [2022-12-06 00:11:37,210 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-06 00:11:37,215 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 00:11:37,225 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2022-12-06 00:11:37,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 301 flow [2022-12-06 00:11:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-06 00:11:37,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2022-12-06 00:11:37,235 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 106 flow. Second operand 3 states and 65 transitions. [2022-12-06 00:11:37,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 301 flow [2022-12-06 00:11:37,241 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 00:11:37,242 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,244 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 00:11:37,246 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-06 00:11:37,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:37,247 INFO L89 Accepts]: Start accepts. Operand has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:37,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:37,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,271 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2022-12-06 00:11:37,271 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:11:37,272 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 00:11:37,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-06 00:11:37,324 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:37,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 00:11:37,325 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 123 flow [2022-12-06 00:11:37,325 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 00:11:37,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:37,326 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 00:11:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:11:37,326 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 00:11:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1846233153, now seen corresponding path program 1 times [2022-12-06 00:11:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:37,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722958072] [2022-12-06 00:11:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:37,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722958072] [2022-12-06 00:11:37,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722958072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:37,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:37,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185388339] [2022-12-06 00:11:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:37,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:37,471 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 00:11:37,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:37,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:37,924 INFO L130 PetriNetUnfolder]: 2945/4072 cut-off events. [2022-12-06 00:11:37,924 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2022-12-06 00:11:37,927 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 00:11:37,937 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 44 selfloop transitions, 2 changer transitions 59/105 dead transitions. [2022-12-06 00:11:37,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 489 flow [2022-12-06 00:11:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:11:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:11:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 00:11:37,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2022-12-06 00:11:37,939 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 123 flow. Second operand 5 states and 105 transitions. [2022-12-06 00:11:37,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 489 flow [2022-12-06 00:11:37,940 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 00:11:37,941 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 160 flow [2022-12-06 00:11:37,942 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 00:11:37,942 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-06 00:11:37,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:37,942 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 160 flow [2022-12-06 00:11:37,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:37,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:37,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 160 flow [2022-12-06 00:11:37,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 160 flow [2022-12-06 00:11:37,954 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 00:11:37,954 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-06 00:11:37,954 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 00:11:37,954 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 00:11:37,954 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 00:11:37,956 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 00:11:37,956 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 00:11:37,956 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 00:11:37,956 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 00:11:37,956 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 00:11:37,963 INFO L130 PetriNetUnfolder]: 93/187 cut-off events. [2022-12-06 00:11:37,963 INFO L131 PetriNetUnfolder]: For 101/139 co-relation queries the response was YES. [2022-12-06 00:11:37,963 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 00:11:37,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 160 flow [2022-12-06 00:11:37,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 00:11:39,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:39,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1635 [2022-12-06 00:11:39,577 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 156 flow [2022-12-06 00:11:39,578 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 00:11:39,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:39,578 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 00:11:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:11:39,578 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 00:11:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 928199408, now seen corresponding path program 1 times [2022-12-06 00:11:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:39,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772451816] [2022-12-06 00:11:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:39,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772451816] [2022-12-06 00:11:39,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772451816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:39,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:39,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183156910] [2022-12-06 00:11:39,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:11:39,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:39,702 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 00:11:39,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:39,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:39,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:40,062 INFO L130 PetriNetUnfolder]: 2852/3828 cut-off events. [2022-12-06 00:11:40,062 INFO L131 PetriNetUnfolder]: For 2964/2964 co-relation queries the response was YES. [2022-12-06 00:11:40,066 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 00:11:40,078 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-06 00:11:40,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 367 flow [2022-12-06 00:11:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 00:11:40,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2022-12-06 00:11:40,080 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 156 flow. Second operand 3 states and 67 transitions. [2022-12-06 00:11:40,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 367 flow [2022-12-06 00:11:40,084 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 00:11:40,085 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,085 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 00:11:40,086 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-06 00:11:40,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:40,086 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:40,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:40,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,104 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 00:11:40,104 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,104 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:11:40,104 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,104 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,109 INFO L130 PetriNetUnfolder]: 97/215 cut-off events. [2022-12-06 00:11:40,109 INFO L131 PetriNetUnfolder]: For 126/154 co-relation queries the response was YES. [2022-12-06 00:11:40,110 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 00:11:40,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 00:11:40,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:40,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 00:11:40,113 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 146 flow [2022-12-06 00:11:40,113 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 00:11:40,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:40,114 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 00:11:40,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:11:40,114 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 00:11:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1651102280, now seen corresponding path program 1 times [2022-12-06 00:11:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:40,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122744882] [2022-12-06 00:11:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:40,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122744882] [2022-12-06 00:11:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122744882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:40,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443142698] [2022-12-06 00:11:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:11:40,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:40,289 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 00:11:40,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:40,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:40,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:40,636 INFO L130 PetriNetUnfolder]: 2676/3626 cut-off events. [2022-12-06 00:11:40,636 INFO L131 PetriNetUnfolder]: For 2936/2936 co-relation queries the response was YES. [2022-12-06 00:11:40,638 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 00:11:40,651 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2022-12-06 00:11:40,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 359 flow [2022-12-06 00:11:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-06 00:11:40,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2022-12-06 00:11:40,653 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 146 flow. Second operand 3 states and 68 transitions. [2022-12-06 00:11:40,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 359 flow [2022-12-06 00:11:40,656 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 00:11:40,657 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,657 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 00:11:40,658 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-06 00:11:40,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:40,658 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:40,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:40,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,672 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 00:11:40,672 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,673 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,673 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:40,673 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:11:40,679 INFO L130 PetriNetUnfolder]: 100/229 cut-off events. [2022-12-06 00:11:40,679 INFO L131 PetriNetUnfolder]: For 72/73 co-relation queries the response was YES. [2022-12-06 00:11:40,679 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 00:11:40,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 00:11:40,716 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:40,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 00:11:40,721 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 142 flow [2022-12-06 00:11:40,721 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 00:11:40,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:40,721 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 00:11:40,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:11:40,721 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 00:11:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash 259568521, now seen corresponding path program 1 times [2022-12-06 00:11:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:40,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963476364] [2022-12-06 00:11:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:40,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:40,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963476364] [2022-12-06 00:11:40,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963476364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:40,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:40,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728011678] [2022-12-06 00:11:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:40,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:11:40,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:40,876 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 00:11:40,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:40,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:40,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:41,245 INFO L130 PetriNetUnfolder]: 3151/4249 cut-off events. [2022-12-06 00:11:41,246 INFO L131 PetriNetUnfolder]: For 2452/2452 co-relation queries the response was YES. [2022-12-06 00:11:41,250 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 00:11:41,267 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 60 selfloop transitions, 2 changer transitions 8/70 dead transitions. [2022-12-06 00:11:41,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 351 flow [2022-12-06 00:11:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-06 00:11:41,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2022-12-06 00:11:41,268 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 142 flow. Second operand 3 states and 71 transitions. [2022-12-06 00:11:41,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 351 flow [2022-12-06 00:11:41,270 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 00:11:41,271 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,272 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 00:11:41,273 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-06 00:11:41,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:41,273 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:41,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:41,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,289 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 00:11:41,289 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 00:11:41,289 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:41,289 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:11:41,289 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:11:41,300 INFO L130 PetriNetUnfolder]: 120/259 cut-off events. [2022-12-06 00:11:41,300 INFO L131 PetriNetUnfolder]: For 96/97 co-relation queries the response was YES. [2022-12-06 00:11:41,301 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 00:11:41,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:11:41,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:41,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 00:11:41,305 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 148 flow [2022-12-06 00:11:41,305 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 00:11:41,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:41,306 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 00:11:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:11:41,306 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 00:11:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1810557708, now seen corresponding path program 1 times [2022-12-06 00:11:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:41,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365252464] [2022-12-06 00:11:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:41,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365252464] [2022-12-06 00:11:41,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365252464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:41,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:41,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562127015] [2022-12-06 00:11:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:41,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:41,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:41,441 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 00:11:41,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:41,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:42,126 INFO L130 PetriNetUnfolder]: 5282/7293 cut-off events. [2022-12-06 00:11:42,126 INFO L131 PetriNetUnfolder]: For 4496/4496 co-relation queries the response was YES. [2022-12-06 00:11:42,133 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 00:11:42,145 INFO L137 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 3 changer transitions 67/113 dead transitions. [2022-12-06 00:11:42,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 570 flow [2022-12-06 00:11:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:11:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:11:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 00:11:42,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2022-12-06 00:11:42,146 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 148 flow. Second operand 5 states and 111 transitions. [2022-12-06 00:11:42,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 570 flow [2022-12-06 00:11:42,148 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 00:11:42,149 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 172 flow [2022-12-06 00:11:42,149 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 00:11:42,149 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-06 00:11:42,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:42,149 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 172 flow [2022-12-06 00:11:42,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:42,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:42,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 172 flow [2022-12-06 00:11:42,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 172 flow [2022-12-06 00:11:42,164 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 00:11:42,164 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 00:11:42,164 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:42,164 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:42,164 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:11:42,174 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 00:11:42,175 INFO L131 PetriNetUnfolder]: For 102/103 co-relation queries the response was YES. [2022-12-06 00:11:42,175 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 00:11:42,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 172 flow [2022-12-06 00:11:42,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:11:42,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:42,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 00:11:42,532 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 168 flow [2022-12-06 00:11:42,532 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 00:11:42,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:42,532 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 00:11:42,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:11:42,532 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 00:11:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash 826560604, now seen corresponding path program 1 times [2022-12-06 00:11:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:42,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011188056] [2022-12-06 00:11:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011188056] [2022-12-06 00:11:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011188056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:42,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:42,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101461137] [2022-12-06 00:11:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:42,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:42,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:42,689 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 00:11:42,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:42,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:42,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:43,176 INFO L130 PetriNetUnfolder]: 3650/5067 cut-off events. [2022-12-06 00:11:43,176 INFO L131 PetriNetUnfolder]: For 3518/3518 co-relation queries the response was YES. [2022-12-06 00:11:43,182 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 00:11:43,190 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 43 selfloop transitions, 3 changer transitions 47/93 dead transitions. [2022-12-06 00:11:43,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 486 flow [2022-12-06 00:11:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:11:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:11:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 00:11:43,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2022-12-06 00:11:43,191 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 168 flow. Second operand 5 states and 91 transitions. [2022-12-06 00:11:43,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 486 flow [2022-12-06 00:11:43,194 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 00:11:43,196 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 168 flow [2022-12-06 00:11:43,196 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 00:11:43,197 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-06 00:11:43,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:43,197 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 168 flow [2022-12-06 00:11:43,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:43,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:43,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 168 flow [2022-12-06 00:11:43,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 168 flow [2022-12-06 00:11:43,211 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 00:11:43,211 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 00:11:43,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:43,212 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:43,212 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:11:43,222 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 00:11:43,223 INFO L131 PetriNetUnfolder]: For 103/104 co-relation queries the response was YES. [2022-12-06 00:11:43,223 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 00:11:43,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 168 flow [2022-12-06 00:11:43,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:11:43,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:43,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 355 [2022-12-06 00:11:43,552 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 164 flow [2022-12-06 00:11:43,552 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 00:11:43,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:43,552 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 00:11:43,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:11:43,552 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 00:11:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash 690203490, now seen corresponding path program 1 times [2022-12-06 00:11:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:43,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481171858] [2022-12-06 00:11:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:43,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481171858] [2022-12-06 00:11:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481171858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:43,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:43,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317628463] [2022-12-06 00:11:43,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:43,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:43,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:43,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:43,682 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 00:11:43,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:43,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:43,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:44,084 INFO L130 PetriNetUnfolder]: 3522/4835 cut-off events. [2022-12-06 00:11:44,084 INFO L131 PetriNetUnfolder]: For 3477/3477 co-relation queries the response was YES. [2022-12-06 00:11:44,091 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 00:11:44,104 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 43 selfloop transitions, 3 changer transitions 25/71 dead transitions. [2022-12-06 00:11:44,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 386 flow [2022-12-06 00:11:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:11:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:11:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 00:11:44,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33170731707317075 [2022-12-06 00:11:44,106 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 164 flow. Second operand 5 states and 68 transitions. [2022-12-06 00:11:44,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 386 flow [2022-12-06 00:11:44,108 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 00:11:44,109 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 162 flow [2022-12-06 00:11:44,109 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 00:11:44,111 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-06 00:11:44,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:44,111 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 162 flow [2022-12-06 00:11:44,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:44,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:44,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 162 flow [2022-12-06 00:11:44,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 162 flow [2022-12-06 00:11:44,125 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 00:11:44,125 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-06 00:11:44,125 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:44,125 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:11:44,125 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:11:44,135 INFO L130 PetriNetUnfolder]: 120/260 cut-off events. [2022-12-06 00:11:44,136 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-12-06 00:11:44,136 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 00:11:44,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 162 flow [2022-12-06 00:11:44,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-06 00:11:44,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:44,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 00:11:44,493 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 158 flow [2022-12-06 00:11:44,493 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 00:11:44,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:44,493 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 00:11:44,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:11:44,493 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 00:11:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -583479235, now seen corresponding path program 1 times [2022-12-06 00:11:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:44,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141696311] [2022-12-06 00:11:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141696311] [2022-12-06 00:11:44,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141696311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:44,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:44,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:11:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512439704] [2022-12-06 00:11:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:44,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:11:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:11:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:11:44,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:44,682 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 00:11:44,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:44,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:44,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:44,958 INFO L130 PetriNetUnfolder]: 1883/2539 cut-off events. [2022-12-06 00:11:44,958 INFO L131 PetriNetUnfolder]: For 1870/1870 co-relation queries the response was YES. [2022-12-06 00:11:44,962 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 00:11:44,968 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 47 selfloop transitions, 2 changer transitions 9/58 dead transitions. [2022-12-06 00:11:44,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 306 flow [2022-12-06 00:11:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:11:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:11:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 00:11:44,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2022-12-06 00:11:44,969 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 158 flow. Second operand 3 states and 55 transitions. [2022-12-06 00:11:44,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 306 flow [2022-12-06 00:11:44,971 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 00:11:44,972 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 160 flow [2022-12-06 00:11:44,972 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 00:11:44,972 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-06 00:11:44,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:44,973 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 160 flow [2022-12-06 00:11:44,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:44,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:44,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-06 00:11:44,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 160 flow [2022-12-06 00:11:44,995 INFO L130 PetriNetUnfolder]: 65/151 cut-off events. [2022-12-06 00:11:44,995 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 00:11:44,996 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 00:11:44,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 160 flow [2022-12-06 00:11:44,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 00:11:46,219 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:11:46,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1247 [2022-12-06 00:11:46,220 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 158 flow [2022-12-06 00:11:46,220 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 00:11:46,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:46,220 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 00:11:46,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:11:46,221 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 00:11:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -540429184, now seen corresponding path program 1 times [2022-12-06 00:11:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:46,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419763476] [2022-12-06 00:11:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:46,373 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 00:11:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:46,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419763476] [2022-12-06 00:11:46,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419763476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:46,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:46,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956550871] [2022-12-06 00:11:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:46,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:46,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:46,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:11:46,374 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 00:11:46,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:46,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:11:46,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:46,673 INFO L130 PetriNetUnfolder]: 2142/3049 cut-off events. [2022-12-06 00:11:46,673 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-12-06 00:11:46,677 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 00:11:46,684 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 44 selfloop transitions, 2 changer transitions 67/113 dead transitions. [2022-12-06 00:11:46,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 113 transitions, 590 flow [2022-12-06 00:11:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:11:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:11:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-06 00:11:46,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2022-12-06 00:11:46,685 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 158 flow. Second operand 5 states and 113 transitions. [2022-12-06 00:11:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 113 transitions, 590 flow [2022-12-06 00:11:46,686 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 00:11:46,687 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 184 flow [2022-12-06 00:11:46,688 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 00:11:46,688 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-06 00:11:46,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:46,688 INFO L89 Accepts]: Start accepts. Operand has 55 places, 46 transitions, 184 flow [2022-12-06 00:11:46,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:46,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:46,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 46 transitions, 184 flow [2022-12-06 00:11:46,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 184 flow [2022-12-06 00:11:46,704 INFO L130 PetriNetUnfolder]: 65/149 cut-off events. [2022-12-06 00:11:46,705 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 00:11:46,705 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 00:11:46,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 184 flow [2022-12-06 00:11:46,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 00:11:48,961 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:11:48,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2273 [2022-12-06 00:11:48,962 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2022-12-06 00:11:48,962 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 00:11:48,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:48,962 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 00:11:48,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:11:48,962 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 00:11:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -82120250, now seen corresponding path program 1 times [2022-12-06 00:11:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:48,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762138120] [2022-12-06 00:11:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:49,083 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 00:11:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762138120] [2022-12-06 00:11:49,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762138120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:49,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:11:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849805491] [2022-12-06 00:11:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:49,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:11:49,085 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 00:11:49,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:49,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:11:49,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:49,317 INFO L130 PetriNetUnfolder]: 1517/2089 cut-off events. [2022-12-06 00:11:49,317 INFO L131 PetriNetUnfolder]: For 2007/2007 co-relation queries the response was YES. [2022-12-06 00:11:49,320 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 00:11:49,324 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 53 selfloop transitions, 7 changer transitions 16/76 dead transitions. [2022-12-06 00:11:49,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 429 flow [2022-12-06 00:11:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 00:11:49,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-06 00:11:49,325 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 4 states and 77 transitions. [2022-12-06 00:11:49,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 429 flow [2022-12-06 00:11:49,326 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 00:11:49,327 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,327 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 00:11:49,327 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-06 00:11:49,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:49,328 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:49,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:49,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,346 INFO L130 PetriNetUnfolder]: 70/180 cut-off events. [2022-12-06 00:11:49,346 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 00:11:49,346 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 00:11:49,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 00:11:49,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:49,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:11:49,348 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 199 flow [2022-12-06 00:11:49,349 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 00:11:49,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:49,349 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 00:11:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:11:49,349 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 00:11:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 347761394, now seen corresponding path program 1 times [2022-12-06 00:11:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:49,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749693259] [2022-12-06 00:11:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:49,540 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 00:11:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:49,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749693259] [2022-12-06 00:11:49,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749693259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:49,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:49,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:11:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000092969] [2022-12-06 00:11:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:49,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:11:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:49,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:11:49,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:11:49,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:11:49,543 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 00:11:49,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:49,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:11:49,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:49,869 INFO L130 PetriNetUnfolder]: 1799/2563 cut-off events. [2022-12-06 00:11:49,869 INFO L131 PetriNetUnfolder]: For 2541/2541 co-relation queries the response was YES. [2022-12-06 00:11:49,873 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 00:11:49,878 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 47 selfloop transitions, 2 changer transitions 50/99 dead transitions. [2022-12-06 00:11:49,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 558 flow [2022-12-06 00:11:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:11:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:11:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 00:11:49,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-06 00:11:49,879 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 199 flow. Second operand 6 states and 93 transitions. [2022-12-06 00:11:49,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 558 flow [2022-12-06 00:11:49,881 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 00:11:49,882 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 211 flow [2022-12-06 00:11:49,882 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 00:11:49,883 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-06 00:11:49,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:49,883 INFO L89 Accepts]: Start accepts. Operand has 61 places, 49 transitions, 211 flow [2022-12-06 00:11:49,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:49,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:49,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 211 flow [2022-12-06 00:11:49,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 211 flow [2022-12-06 00:11:49,902 INFO L130 PetriNetUnfolder]: 71/181 cut-off events. [2022-12-06 00:11:49,902 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-06 00:11:49,903 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 00:11:49,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 211 flow [2022-12-06 00:11:49,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 00:11:51,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:51,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2079 [2022-12-06 00:11:51,962 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 207 flow [2022-12-06 00:11:51,962 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 00:11:51,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:51,962 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 00:11:51,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:11:51,962 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 00:11:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -294946541, now seen corresponding path program 1 times [2022-12-06 00:11:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:51,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608742445] [2022-12-06 00:11:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:52,258 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 00:11:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608742445] [2022-12-06 00:11:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608742445] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760284719] [2022-12-06 00:11:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:52,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:11:52,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:11:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:52,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:11:52,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:52,547 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 00:11:52,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:11:52,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760284719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:52,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:11:52,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-06 00:11:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514064837] [2022-12-06 00:11:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:52,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:11:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:11:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:11:52,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:11:52,549 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 00:11:52,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:52,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:11:52,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:53,039 INFO L130 PetriNetUnfolder]: 2746/3991 cut-off events. [2022-12-06 00:11:53,039 INFO L131 PetriNetUnfolder]: For 4848/4848 co-relation queries the response was YES. [2022-12-06 00:11:53,045 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 00:11:53,050 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 46 selfloop transitions, 3 changer transitions 107/156 dead transitions. [2022-12-06 00:11:53,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 156 transitions, 929 flow [2022-12-06 00:11:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:11:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:11:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-06 00:11:53,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 00:11:53,051 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 207 flow. Second operand 7 states and 144 transitions. [2022-12-06 00:11:53,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 156 transitions, 929 flow [2022-12-06 00:11:53,053 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 00:11:53,054 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 223 flow [2022-12-06 00:11:53,055 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 00:11:53,055 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-06 00:11:53,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:53,055 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 223 flow [2022-12-06 00:11:53,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:53,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:53,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 223 flow [2022-12-06 00:11:53,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 223 flow [2022-12-06 00:11:53,076 INFO L130 PetriNetUnfolder]: 71/181 cut-off events. [2022-12-06 00:11:53,076 INFO L131 PetriNetUnfolder]: For 183/199 co-relation queries the response was YES. [2022-12-06 00:11:53,077 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 00:11:53,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 223 flow [2022-12-06 00:11:53,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 00:11:53,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:53,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-06 00:11:53,453 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 219 flow [2022-12-06 00:11:53,454 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 00:11:53,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:53,454 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 00:11:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:11:53,662 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 00:11:53,662 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 00:11:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 344546858, now seen corresponding path program 1 times [2022-12-06 00:11:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108426309] [2022-12-06 00:11:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:53,898 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 00:11:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108426309] [2022-12-06 00:11:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108426309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774858050] [2022-12-06 00:11:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:53,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:11:53,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:11:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:54,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:11:54,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:11:54,115 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 00:11:54,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:11:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774858050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:54,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:11:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-06 00:11:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764575898] [2022-12-06 00:11:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:54,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:11:54,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:11:54,116 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 00:11:54,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:54,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:11:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:54,597 INFO L130 PetriNetUnfolder]: 3707/4987 cut-off events. [2022-12-06 00:11:54,598 INFO L131 PetriNetUnfolder]: For 8396/8396 co-relation queries the response was YES. [2022-12-06 00:11:54,605 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 00:11:54,615 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 92 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2022-12-06 00:11:54,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 622 flow [2022-12-06 00:11:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 00:11:54,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54375 [2022-12-06 00:11:54,617 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 219 flow. Second operand 4 states and 87 transitions. [2022-12-06 00:11:54,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 622 flow [2022-12-06 00:11:54,625 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 00:11:54,626 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,626 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 00:11:54,626 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-06 00:11:54,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:54,626 INFO L89 Accepts]: Start accepts. Operand has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:54,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:54,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,661 INFO L130 PetriNetUnfolder]: 161/359 cut-off events. [2022-12-06 00:11:54,661 INFO L131 PetriNetUnfolder]: For 326/328 co-relation queries the response was YES. [2022-12-06 00:11:54,662 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 00:11:54,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:11:54,665 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:11:54,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 00:11:54,665 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 227 flow [2022-12-06 00:11:54,666 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 00:11:54,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:54,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, 1, 1, 1, 1] [2022-12-06 00:11:54,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:11:54,871 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 00:11:54,872 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 00:11:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 499288996, now seen corresponding path program 1 times [2022-12-06 00:11:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:54,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060606036] [2022-12-06 00:11:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:59,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:59,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060606036] [2022-12-06 00:11:59,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060606036] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:11:59,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918580839] [2022-12-06 00:11:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:59,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:11:59,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:11:59,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:11:59,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:12:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:00,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-06 00:12:00,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:12:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:12:01,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:12:22,140 WARN L233 SmtUtils]: Spent 17.55s 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 00:12:22,144 INFO L321 Elim1Store]: treesize reduction 261, result has 95.7 percent of original size [2022-12-06 00:12:22,145 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 00:25:36,826 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 00:25:36,828 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 00:25:36,834 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 00:25:36,863 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 00:25:36,864 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 00:25:37,034 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 00:25:37,034 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 36 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. [2022-12-06 00:25:37,037 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 00:25:37,037 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 00:25:37,037 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 00:25:37,037 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 00:25:37,038 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:25:37,040 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:25:37,040 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:25:37,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:25:37 BasicIcfg [2022-12-06 00:25:37,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:25:37,042 INFO L158 Benchmark]: Toolchain (without parser) took 853366.06ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 965.7MB). Free memory was 145.9MB in the beginning and 653.0MB in the end (delta: -507.1MB). Peak memory consumption was 701.4MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,042 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:25:37,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 129.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.33ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 126.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,042 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 182.5MB. Free memory was 126.0MB in the beginning and 123.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,042 INFO L158 Benchmark]: RCFGBuilder took 993.31ms. Allocated memory is still 182.5MB. Free memory was 123.3MB in the beginning and 151.0MB in the end (delta: -27.7MB). Peak memory consumption was 71.9MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,043 INFO L158 Benchmark]: TraceAbstraction took 851950.98ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 965.7MB). Free memory was 150.5MB in the beginning and 653.0MB in the end (delta: -502.5MB). Peak memory consumption was 704.9MB. Max. memory is 8.0GB. [2022-12-06 00:25:37,044 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.11ms. Allocated memory is still 182.5MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 182.5MB. Free memory was 145.9MB in the beginning and 129.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.33ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 126.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 182.5MB. Free memory was 126.0MB in the beginning and 123.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 993.31ms. Allocated memory is still 182.5MB. Free memory was 123.3MB in the beginning and 151.0MB in the end (delta: -27.7MB). Peak memory consumption was 71.9MB. Max. memory is 8.0GB. * TraceAbstraction took 851950.98ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 965.7MB). Free memory was 150.5MB in the beginning and 653.0MB in the end (delta: -502.5MB). Peak memory consumption was 704.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8s, 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: 154, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 70, dependent conditional: 0, dependent unconditional: 70, 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: 49, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 26, dependent conditional: 5, dependent unconditional: 21, 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: 30, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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.3s, 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.4s, 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.2s, 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: 29, independent: 29, independent conditional: 0, independent unconditional: 29, 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.3s, 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: 2.1s, 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 SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 18ms.. - 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: 851.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, 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.1s 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