/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:07:19,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:07:19,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:07:20,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:07:20,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:07:20,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:07:20,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:07:20,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:07:20,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:07:20,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:07:20,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:07:20,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:07:20,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:07:20,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:07:20,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:07:20,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:07:20,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:07:20,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:07:20,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:07:20,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:07:20,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:07:20,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:07:20,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:07:20,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:07:20,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:07:20,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:07:20,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:07:20,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:07:20,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:07:20,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:07:20,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:07:20,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:07:20,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:07:20,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:07:20,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:07:20,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:07:20,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:07:20,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:07:20,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:07:20,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:07:20,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:07:20,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:07:20,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:07:20,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:07:20,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:07:20,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:07:20,119 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:07:20,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:07:20,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:07:20,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:07:20,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:07:20,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:07:20,121 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:07:20,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:07:20,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:07:20,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:07:20,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:07:20,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:07:20,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:20,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:07:20,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:07:20,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:07:20,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:07:20,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:07:20,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:07:20,433 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:07:20,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2022-12-06 05:07:21,601 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:07:21,822 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:07:21,823 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2022-12-06 05:07:21,837 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd08fe8ad/a936c7c5340842c2a46ef3acb8be57e9/FLAG844e55540 [2022-12-06 05:07:21,853 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd08fe8ad/a936c7c5340842c2a46ef3acb8be57e9 [2022-12-06 05:07:21,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:07:21,856 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:07:21,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:21,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:07:21,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:07:21,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:21" (1/1) ... [2022-12-06 05:07:21,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d251daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:21, skipping insertion in model container [2022-12-06 05:07:21,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:21" (1/1) ... [2022-12-06 05:07:21,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:07:21,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:07:22,096 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/chl-node-symm.wvr.c[3305,3318] [2022-12-06 05:07:22,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:22,131 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:07:22,171 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/chl-node-symm.wvr.c[3305,3318] [2022-12-06 05:07:22,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:22,190 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:07:22,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22 WrapperNode [2022-12-06 05:07:22,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:22,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:22,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:07:22,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:07:22,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,257 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 282 [2022-12-06 05:07:22,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:22,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:07:22,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:07:22,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:07:22,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,311 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:07:22,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:07:22,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:07:22,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:07:22,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (1/1) ... [2022-12-06 05:07:22,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:22,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:07:22,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:07:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:07:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:07:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:07:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:07:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:07:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:07:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:07:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:07:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:07:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:07:22,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:07:22,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:07:22,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:07:22,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:07:22,503 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:07:22,505 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:07:22,920 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:07:22,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:07:22,930 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:07:22,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:22 BoogieIcfgContainer [2022-12-06 05:07:22,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:07:22,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:07:22,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:07:22,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:07:22,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:07:21" (1/3) ... [2022-12-06 05:07:22,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37504e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:22, skipping insertion in model container [2022-12-06 05:07:22,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:22" (2/3) ... [2022-12-06 05:07:22,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37504e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:22, skipping insertion in model container [2022-12-06 05:07:22,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:22" (3/3) ... [2022-12-06 05:07:22,938 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2022-12-06 05:07:22,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:07:22,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:07:22,950 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:07:23,031 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:07:23,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 331 transitions, 678 flow [2022-12-06 05:07:23,208 INFO L130 PetriNetUnfolder]: 28/329 cut-off events. [2022-12-06 05:07:23,209 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:23,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 329 events. 28/329 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 330 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 258. Up to 2 conditions per place. [2022-12-06 05:07:23,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 331 transitions, 678 flow [2022-12-06 05:07:23,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 321 transitions, 654 flow [2022-12-06 05:07:23,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:23,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 300 places, 321 transitions, 654 flow [2022-12-06 05:07:23,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 321 transitions, 654 flow [2022-12-06 05:07:23,394 INFO L130 PetriNetUnfolder]: 28/321 cut-off events. [2022-12-06 05:07:23,394 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:23,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 321 events. 28/321 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 331 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 258. Up to 2 conditions per place. [2022-12-06 05:07:23,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 321 transitions, 654 flow [2022-12-06 05:07:23,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 6048 [2022-12-06 05:07:35,651 INFO L203 LiptonReduction]: Total number of compositions: 295 [2022-12-06 05:07:35,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:07:35,668 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;@5abde9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:07:35,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:07:35,674 INFO L130 PetriNetUnfolder]: 6/25 cut-off events. [2022-12-06 05:07:35,674 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:35,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:35,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:35,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1474223832, now seen corresponding path program 1 times [2022-12-06 05:07:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:35,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769993203] [2022-12-06 05:07:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:35,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769993203] [2022-12-06 05:07:35,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769993203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:35,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:35,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59138812] [2022-12-06 05:07:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:07:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:07:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:07:36,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:07:36,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:36,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:36,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:07:36,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:36,114 INFO L130 PetriNetUnfolder]: 55/109 cut-off events. [2022-12-06 05:07:36,115 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:07:36,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 109 events. 55/109 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 27 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 195. Up to 79 conditions per place. [2022-12-06 05:07:36,119 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 05:07:36,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 137 flow [2022-12-06 05:07:36,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:07:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:07:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:07:36,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 05:07:36,131 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 64 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:07:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 137 flow [2022-12-06 05:07:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:07:36,136 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-06 05:07:36,142 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-06 05:07:36,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:36,143 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:36,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:36,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,160 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 05:07:36,160 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:07:36,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2022-12-06 05:07:36,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:36,175 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:36,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 05:07:36,178 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 74 flow [2022-12-06 05:07:36,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:36,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:36,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:36,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:07:36,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2074766419, now seen corresponding path program 1 times [2022-12-06 05:07:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:36,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842251827] [2022-12-06 05:07:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:36,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842251827] [2022-12-06 05:07:36,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842251827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:36,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:36,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:07:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259770500] [2022-12-06 05:07:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:36,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:07:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:36,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:07:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:07:36,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:07:36,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:36,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:36,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:07:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:36,433 INFO L130 PetriNetUnfolder]: 55/110 cut-off events. [2022-12-06 05:07:36,434 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 05:07:36,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 110 events. 55/110 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 276 event pairs, 39 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 130. Up to 109 conditions per place. [2022-12-06 05:07:36,435 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 05:07:36,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 130 flow [2022-12-06 05:07:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:07:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:07:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:07:36,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 05:07:36,438 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 74 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:07:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 130 flow [2022-12-06 05:07:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:36,442 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 80 flow [2022-12-06 05:07:36,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2022-12-06 05:07:36,443 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 05:07:36,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:36,443 INFO L89 Accepts]: Start accepts. Operand has 28 places, 28 transitions, 80 flow [2022-12-06 05:07:36,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:36,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:36,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 28 transitions, 80 flow [2022-12-06 05:07:36,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 28 transitions, 80 flow [2022-12-06 05:07:36,452 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 05:07:36,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:07:36,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 28 events. 6/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2022-12-06 05:07:36,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 28 transitions, 80 flow [2022-12-06 05:07:36,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:37,707 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:37,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1266 [2022-12-06 05:07:37,710 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 76 flow [2022-12-06 05:07:37,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:37,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:37,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:37,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:07:37,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash -469663924, now seen corresponding path program 1 times [2022-12-06 05:07:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969446796] [2022-12-06 05:07:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:37,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969446796] [2022-12-06 05:07:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969446796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592506764] [2022-12-06 05:07:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:37,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:37,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:37,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:07:37,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:37,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:37,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:07:37,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:37,931 INFO L130 PetriNetUnfolder]: 61/121 cut-off events. [2022-12-06 05:07:37,931 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:07:37,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 121 events. 61/121 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 45 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 281. Up to 120 conditions per place. [2022-12-06 05:07:37,932 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 25 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-12-06 05:07:37,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 134 flow [2022-12-06 05:07:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 05:07:37,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2022-12-06 05:07:37,933 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 76 flow. Second operand 4 states and 28 transitions. [2022-12-06 05:07:37,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 134 flow [2022-12-06 05:07:37,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 126 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:07:37,935 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:37,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 05:07:37,936 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 05:07:37,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:37,936 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:37,937 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:37,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:37,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:37,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:37,942 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 05:07:37,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:07:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 6/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-06 05:07:37,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:37,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:38,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:07:38,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 296 [2022-12-06 05:07:38,232 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 78 flow [2022-12-06 05:07:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:38,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:38,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:38,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:07:38,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 872189539, now seen corresponding path program 1 times [2022-12-06 05:07:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:38,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811464096] [2022-12-06 05:07:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:38,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811464096] [2022-12-06 05:07:38,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811464096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:38,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:38,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849258614] [2022-12-06 05:07:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:38,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:38,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 05:07:38,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:38,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:38,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 05:07:38,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:38,454 INFO L130 PetriNetUnfolder]: 55/110 cut-off events. [2022-12-06 05:07:38,454 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:07:38,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 110 events. 55/110 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 279 event pairs, 39 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 253. Up to 108 conditions per place. [2022-12-06 05:07:38,455 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 24 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-12-06 05:07:38,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 134 flow [2022-12-06 05:07:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 05:07:38,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2980769230769231 [2022-12-06 05:07:38,457 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 78 flow. Second operand 4 states and 31 transitions. [2022-12-06 05:07:38,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 134 flow [2022-12-06 05:07:38,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 124 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:38,458 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:38,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2022-12-06 05:07:38,459 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 05:07:38,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:38,459 INFO L89 Accepts]: Start accepts. Operand has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:38,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:38,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:38,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:38,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:38,465 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 05:07:38,465 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:38,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 6/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2022-12-06 05:07:38,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 82 flow [2022-12-06 05:07:38,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:38,713 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:38,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 05:07:38,714 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 78 flow [2022-12-06 05:07:38,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:38,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:38,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:07:38,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 29852778, now seen corresponding path program 1 times [2022-12-06 05:07:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:38,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725768372] [2022-12-06 05:07:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:38,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:38,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725768372] [2022-12-06 05:07:38,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725768372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:38,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:38,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:07:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408384757] [2022-12-06 05:07:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:07:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:07:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:07:38,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:07:38,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:38,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:38,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:07:38,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:38,940 INFO L130 PetriNetUnfolder]: 61/121 cut-off events. [2022-12-06 05:07:38,940 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 05:07:38,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 121 events. 61/121 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 45 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 273. Up to 120 conditions per place. [2022-12-06 05:07:38,941 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 25 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-12-06 05:07:38,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 136 flow [2022-12-06 05:07:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:07:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:07:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 05:07:38,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2022-12-06 05:07:38,942 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 78 flow. Second operand 4 states and 28 transitions. [2022-12-06 05:07:38,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 136 flow [2022-12-06 05:07:38,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 127 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:38,944 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 83 flow [2022-12-06 05:07:38,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-06 05:07:38,945 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2022-12-06 05:07:38,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:38,945 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 83 flow [2022-12-06 05:07:38,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:38,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:38,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 83 flow [2022-12-06 05:07:38,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 83 flow [2022-12-06 05:07:38,950 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 05:07:38,951 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:07:38,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 28 events. 6/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 35. Up to 4 conditions per place. [2022-12-06 05:07:38,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 83 flow [2022-12-06 05:07:38,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:39,188 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:07:39,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 05:07:39,190 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 79 flow [2022-12-06 05:07:39,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:39,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:39,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:39,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:07:39,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -797248059, now seen corresponding path program 1 times [2022-12-06 05:07:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:39,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528254073] [2022-12-06 05:07:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:40,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528254073] [2022-12-06 05:07:40,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528254073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:40,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:40,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:07:40,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568883024] [2022-12-06 05:07:40,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:40,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:07:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:07:40,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:07:40,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:07:40,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 79 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:40,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:40,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:07:40,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:40,526 INFO L130 PetriNetUnfolder]: 61/127 cut-off events. [2022-12-06 05:07:40,526 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:07:40,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 127 events. 61/127 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 21 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 289. Up to 73 conditions per place. [2022-12-06 05:07:40,527 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 35 selfloop transitions, 1 changer transitions 9/45 dead transitions. [2022-12-06 05:07:40,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 220 flow [2022-12-06 05:07:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:07:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:07:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:07:40,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2022-12-06 05:07:40,528 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 79 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:07:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 220 flow [2022-12-06 05:07:40,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:40,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 81 flow [2022-12-06 05:07:40,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-06 05:07:40,531 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 7 predicate places. [2022-12-06 05:07:40,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:40,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 81 flow [2022-12-06 05:07:40,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:40,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:40,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 81 flow [2022-12-06 05:07:40,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 81 flow [2022-12-06 05:07:40,537 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 05:07:40,537 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:40,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2022-12-06 05:07:40,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 81 flow [2022-12-06 05:07:40,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 05:07:40,538 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:07:40,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:07:40,539 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 81 flow [2022-12-06 05:07:40,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:40,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:07:40,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:07:40,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:07:40,540 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:07:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:07:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -372795945, now seen corresponding path program 2 times [2022-12-06 05:07:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:07:40,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846303207] [2022-12-06 05:07:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:07:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:07:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:07:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:07:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:07:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846303207] [2022-12-06 05:07:41,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846303207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:07:41,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:07:41,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:07:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393539924] [2022-12-06 05:07:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:07:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:07:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:07:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:07:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:07:41,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:07:41,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 81 flow. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:07:41,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:07:41,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:07:41,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:07:41,593 INFO L130 PetriNetUnfolder]: 67/154 cut-off events. [2022-12-06 05:07:41,594 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-06 05:07:41,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 154 events. 67/154 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 490 event pairs, 35 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 402. Up to 112 conditions per place. [2022-12-06 05:07:41,595 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 36 selfloop transitions, 6 changer transitions 7/49 dead transitions. [2022-12-06 05:07:41,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 249 flow [2022-12-06 05:07:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:07:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:07:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 05:07:41,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2022-12-06 05:07:41,597 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 81 flow. Second operand 6 states and 49 transitions. [2022-12-06 05:07:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 249 flow [2022-12-06 05:07:41,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 237 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:07:41,598 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 122 flow [2022-12-06 05:07:41,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-06 05:07:41,599 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-06 05:07:41,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:07:41,599 INFO L89 Accepts]: Start accepts. Operand has 38 places, 32 transitions, 122 flow [2022-12-06 05:07:41,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:07:41,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:41,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 122 flow [2022-12-06 05:07:41,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 122 flow [2022-12-06 05:07:41,610 INFO L130 PetriNetUnfolder]: 9/53 cut-off events. [2022-12-06 05:07:41,610 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 05:07:41,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 53 events. 9/53 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 107. Up to 8 conditions per place. [2022-12-06 05:07:41,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 122 flow [2022-12-06 05:07:41,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:07:41,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1245] L52-10-->thread1EXIT: Formula: (and (= v_~result_6~0_73 |v_thread1Thread1of1ForFork0_minus_#res#1_57|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_57| 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_#res#1_57|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_67| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|) (= |v_thread1Thread1of1ForFork0_#res#1.base_23| 0) (= |v_thread1Thread1of1ForFork0_minus_~a#1_61| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem6#1_52|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_61| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_57|)) (= (select (select |v_#memory_int_295| v_~get_5~0.base_87) (+ (* v_~id_3~0_149 4) v_~get_5~0.offset_87)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_23| 0)) InVars {thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_52|, ~get_5~0.base=v_~get_5~0.base_87, ~id_3~0=v_~id_3~0_149, #memory_int=|v_#memory_int_295|, ~get_5~0.offset=v_~get_5~0.offset_87} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_57|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_23|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_37|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~ret8#1=|v_thread1Thread1of1ForFork0_#t~ret8#1_57|, ~result_6~0=v_~result_6~0_73, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_57|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, thread1Thread1of1ForFork0_#t~mem7#1=|v_thread1Thread1of1ForFork0_#t~mem7#1_49|, ~get_5~0.base=v_~get_5~0.base_87, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_67|, ~id_3~0=v_~id_3~0_149, #memory_int=|v_#memory_int_295|, thread1Thread1of1ForFork0_#t~short5#1=|v_thread1Thread1of1ForFork0_#t~short5#1_73|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_65|, thread1Thread1of1ForFork0_#t~ite9#1=|v_thread1Thread1of1ForFork0_#t~ite9#1_53|, ~get_5~0.offset=v_~get_5~0.offset_87, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_#t~ret8#1, ~result_6~0, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~short5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~ite9#1, thread1Thread1of1ForFork0_#res#1.base] and [1198] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_80| |v_ULTIMATE.start_main_#t~pre33#1_53|) (= (store |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre33#1_53|)) |v_#memory_int_245|) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_246|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_29|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_245|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_15|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-06 05:07:41,733 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:07:41,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1159] L51-1-->L52-6: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~mem2#1_28| v_~order2_8~0_17) (not |v_thread1Thread1of1ForFork0_#t~short5#1_39|) (= (mod |v_thread1Thread1of1ForFork0_#t~mem3#1_35| 256) 0) (= |v_thread1Thread1of1ForFork0_#t~mem3#1_35| (select (select |v_#memory_int_203| v_~contains_key_1~0.base_39) (+ v_~id_0~0_111 v_~contains_key_1~0.offset_39)))) InVars {~contains_key_1~0.offset=v_~contains_key_1~0.offset_39, #memory_int=|v_#memory_int_203|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_28|, ~id_0~0=v_~id_0~0_111, ~contains_key_1~0.base=v_~contains_key_1~0.base_39} OutVars{~contains_key_1~0.offset=v_~contains_key_1~0.offset_39, #memory_int=|v_#memory_int_203|, thread1Thread1of1ForFork0_#t~short5#1=|v_thread1Thread1of1ForFork0_#t~short5#1_39|, ~order2_8~0=v_~order2_8~0_17, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, ~id_0~0=v_~id_0~0_111, ~contains_key_1~0.base=v_~contains_key_1~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~short5#1, ~order2_8~0, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] and [1198] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_80| |v_ULTIMATE.start_main_#t~pre33#1_53|) (= (store |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre33#1_53|)) |v_#memory_int_245|) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_246|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_29|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_245|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_15|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-06 05:07:41,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1262] L51-1-->L52-10: Formula: (and (= (select (select |v_#memory_int_379| v_~get_2~0.base_97) (+ v_~get_2~0.offset_97 (* v_~id_0~0_189 4))) |v_thread1Thread1of1ForFork0_#t~mem6#1_69|) (= (mod |v_thread1Thread1of1ForFork0_#t~mem3#1_81| 256) 0) (not |v_thread1Thread1of1ForFork0_#t~short5#1_95|) (= |v_thread1Thread1of1ForFork0_#t~mem3#1_81| (select (select |v_#memory_int_379| v_~contains_key_1~0.base_89) (+ v_~id_0~0_189 v_~contains_key_1~0.offset_89))) (= |v_thread1Thread1of1ForFork0_#t~mem2#1_76| v_~order2_8~0_65)) InVars {~get_2~0.offset=v_~get_2~0.offset_97, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_89, ~get_2~0.base=v_~get_2~0.base_97, #memory_int=|v_#memory_int_379|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_76|, ~id_0~0=v_~id_0~0_189, ~contains_key_1~0.base=v_~contains_key_1~0.base_89} OutVars{~get_2~0.offset=v_~get_2~0.offset_97, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_69|, ~contains_key_1~0.offset=v_~contains_key_1~0.offset_89, ~get_2~0.base=v_~get_2~0.base_97, #memory_int=|v_#memory_int_379|, thread1Thread1of1ForFork0_#t~short5#1=|v_thread1Thread1of1ForFork0_#t~short5#1_95|, ~order2_8~0=v_~order2_8~0_65, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_81|, ~id_0~0=v_~id_0~0_189, ~contains_key_1~0.base=v_~contains_key_1~0.base_89} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem6#1, thread1Thread1of1ForFork0_#t~short5#1, ~order2_8~0, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1] and [1198] L87-4-->L88-3: Formula: (and (= |v_#pthreadsForks_80| |v_ULTIMATE.start_main_#t~pre33#1_53|) (= (store |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_246| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre33#1_53|)) |v_#memory_int_245|) (= |v_#pthreadsForks_79| (+ |v_#pthreadsForks_80| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_246|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_29|, #pthreadsForks=|v_#pthreadsForks_79|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, #memory_int=|v_#memory_int_245|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_15|, ULTIMATE.start_main_#t~pre33#1=|v_ULTIMATE.start_main_#t~pre33#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet32#1, ULTIMATE.start_main_#t~pre33#1] [2022-12-06 05:07:41,859 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:07:41,860 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:07:41,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:07:41,861 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:07:41,863 INFO L158 Benchmark]: Toolchain (without parser) took 20007.03ms. Allocated memory was 185.6MB in the beginning and 290.5MB in the end (delta: 104.9MB). Free memory was 162.9MB in the beginning and 217.2MB in the end (delta: -54.3MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,863 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:07:41,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.12ms. Allocated memory is still 185.6MB. Free memory was 162.6MB in the beginning and 150.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.93ms. Allocated memory is still 185.6MB. Free memory was 150.0MB in the beginning and 147.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,864 INFO L158 Benchmark]: Boogie Preprocessor took 61.10ms. Allocated memory is still 185.6MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,864 INFO L158 Benchmark]: RCFGBuilder took 612.79ms. Allocated memory is still 185.6MB. Free memory was 145.3MB in the beginning and 120.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,865 INFO L158 Benchmark]: TraceAbstraction took 18929.03ms. Allocated memory was 185.6MB in the beginning and 290.5MB in the end (delta: 104.9MB). Free memory was 119.6MB in the beginning and 217.2MB in the end (delta: -97.5MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-12-06 05:07:41,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.12ms. Allocated memory is still 185.6MB. Free memory was 162.6MB in the beginning and 150.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.93ms. Allocated memory is still 185.6MB. Free memory was 150.0MB in the beginning and 147.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.10ms. Allocated memory is still 185.6MB. Free memory was 147.4MB in the beginning and 145.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 612.79ms. Allocated memory is still 185.6MB. Free memory was 145.3MB in the beginning and 120.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18929.03ms. Allocated memory was 185.6MB in the beginning and 290.5MB in the end (delta: 104.9MB). Free memory was 119.6MB in the beginning and 217.2MB in the end (delta: -97.5MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.2s, 300 PlacesBefore, 27 PlacesAfterwards, 321 TransitionsBefore, 26 TransitionsAfterwards, 6048 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 185 TrivialYvCompositions, 88 ConcurrentYvCompositions, 22 ChoiceCompositions, 295 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 3849, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3891, independent: 3849, independent conditional: 0, independent unconditional: 3849, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3514, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3514, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3891, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 3514, unknown conditional: 0, unknown unconditional: 3514] , Statistics on independence cache: Total cache size (in pairs): 7168, Positive cache size: 7141, Positive conditional cache size: 0, Positive unconditional cache size: 7141, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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, 27 PlacesBefore, 27 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 6, independent unconditional: 22, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 28 PlacesBefore, 27 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 29 PlacesBefore, 28 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 72, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 2, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 58, independent conditional: 2, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 58, independent conditional: 2, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 2, independent unconditional: 10, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 74, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:07:41,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...