/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:29:17,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:29:17,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:29:17,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:29:17,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:29:17,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:29:17,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:29:17,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:29:17,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:29:17,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:29:17,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:29:17,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:29:17,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:29:17,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:29:17,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:29:17,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:29:17,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:29:17,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:29:17,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:29:17,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:29:17,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:29:17,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:29:17,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:29:17,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:29:17,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:29:17,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:29:17,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:29:17,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:29:17,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:29:17,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:29:17,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:29:17,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:29:17,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:29:17,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:29:17,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:29:17,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:29:17,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:29:17,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:29:17,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:29:17,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:29:17,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:29:17,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:29:17,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:29:17,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:29:17,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:29:17,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:29:17,953 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:29:17,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:29:17,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:29:17,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:29:17,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:29:17,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:29:17,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:29:17,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:29:17,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:29:17,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:29:17,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:29:17,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:29:17,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:29:17,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:29:17,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:29:17,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:29:17,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:29:17,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:29:17,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:29:17,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:29:17,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:29:17,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:29:17,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:29:17,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:29:17,957 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-13 01:29:18,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:29:18,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:29:18,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:29:18,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:29:18,309 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:29:18,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-13 01:29:19,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:29:19,543 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:29:19,544 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-13 01:29:19,550 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d53aed863/64578aa5fc654c938f0c1393f197420b/FLAG431bf37cd [2022-12-13 01:29:19,562 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d53aed863/64578aa5fc654c938f0c1393f197420b [2022-12-13 01:29:19,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:29:19,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:29:19,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:29:19,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:29:19,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:29:19,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ca85d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19, skipping insertion in model container [2022-12-13 01:29:19,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:29:19,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:29:19,791 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-name-comparator-trans.wvr.c[4788,4801] [2022-12-13 01:29:19,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:29:19,807 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:29:19,846 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-name-comparator-trans.wvr.c[4788,4801] [2022-12-13 01:29:19,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:29:19,868 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:29:19,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19 WrapperNode [2022-12-13 01:29:19,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:29:19,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:29:19,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:29:19,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:29:19,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,944 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-13 01:29:19,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:29:19,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:29:19,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:29:19,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:29:19,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:29:19,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:29:19,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:29:19,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:29:19,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (1/1) ... [2022-12-13 01:29:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:29:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:29:20,024 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-13 01:29:20,035 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-13 01:29:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:29:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:29:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:29:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:29:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:29:20,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:29:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:29:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:29:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:29:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:29:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:29:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:29:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:29:20,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:29:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:29:20,068 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:29:20,183 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:29:20,185 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:29:20,577 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:29:20,590 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:29:20,590 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 01:29:20,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:29:20 BoogieIcfgContainer [2022-12-13 01:29:20,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:29:20,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:29:20,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:29:20,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:29:20,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:29:19" (1/3) ... [2022-12-13 01:29:20,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a338cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:29:20, skipping insertion in model container [2022-12-13 01:29:20,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:29:19" (2/3) ... [2022-12-13 01:29:20,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a338cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:29:20, skipping insertion in model container [2022-12-13 01:29:20,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:29:20" (3/3) ... [2022-12-13 01:29:20,599 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2022-12-13 01:29:20,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:29:20,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:29:20,622 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:29:20,764 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:29:20,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 341 transitions, 706 flow [2022-12-13 01:29:20,990 INFO L130 PetriNetUnfolder]: 26/338 cut-off events. [2022-12-13 01:29:20,990 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:29:21,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 26/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-13 01:29:21,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 341 transitions, 706 flow [2022-12-13 01:29:21,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 328 transitions, 674 flow [2022-12-13 01:29:21,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:21,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-13 01:29:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 328 transitions, 674 flow [2022-12-13 01:29:21,146 INFO L130 PetriNetUnfolder]: 26/328 cut-off events. [2022-12-13 01:29:21,146 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:29:21,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 328 events. 26/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-13 01:29:21,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 312 places, 328 transitions, 674 flow [2022-12-13 01:29:21,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 27528 [2022-12-13 01:29:34,850 INFO L241 LiptonReduction]: Total number of compositions: 304 [2022-12-13 01:29:34,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:29:34,868 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;@4128f8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:29:34,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:29:34,873 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 01:29:34,873 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:29:34,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:34,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:34,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1174101351, now seen corresponding path program 1 times [2022-12-13 01:29:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:34,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137524908] [2022-12-13 01:29:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:34,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:35,384 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-13 01:29:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:35,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137524908] [2022-12-13 01:29:35,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137524908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:29:35,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:29:35,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:29:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036395334] [2022-12-13 01:29:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:29:35,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:29:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:29:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:29:35,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:35,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:35,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:35,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:35,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:35,528 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 01:29:35,528 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 01:29:35,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 328 events. 221/328 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 771 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 534. Up to 328 conditions per place. [2022-12-13 01:29:35,533 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 01:29:35,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 118 flow [2022-12-13 01:29:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:29:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:29:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 01:29:35,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 01:29:35,545 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 26 transitions. [2022-12-13 01:29:35,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 118 flow [2022-12-13 01:29:35,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:29:35,550 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:35,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-13 01:29:35,554 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 01:29:35,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:29:35,555 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:35,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:29:35,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:35,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:35,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:35,565 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 01:29:35,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:29:35,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-13 01:29:35,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:35,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 01:29:37,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:29:37,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1500 [2022-12-13 01:29:37,054 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-13 01:29:37,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:37,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:37,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:37,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:29:37,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 920055315, now seen corresponding path program 1 times [2022-12-13 01:29:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127860088] [2022-12-13 01:29:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:37,162 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-13 01:29:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:37,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127860088] [2022-12-13 01:29:37,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127860088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:29:37,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:29:37,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:29:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426555407] [2022-12-13 01:29:37,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:29:37,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:29:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:29:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:29:37,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:37,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:37,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:37,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:37,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:37,266 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 01:29:37,266 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:29:37,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-13 01:29:37,268 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 01:29:37,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-13 01:29:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:29:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:29:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 01:29:37,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 01:29:37,270 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-13 01:29:37,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-13 01:29:37,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 01:29:37,271 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:37,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-13 01:29:37,272 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 01:29:37,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:29:37,272 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:37,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:29:37,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:37,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:37,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:37,280 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 01:29:37,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:29:37,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-13 01:29:37,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:37,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 01:29:39,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:29:39,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2070 [2022-12-13 01:29:39,342 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-13 01:29:39,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:39,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:39,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:39,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:29:39,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash 511231090, now seen corresponding path program 1 times [2022-12-13 01:29:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:39,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969234247] [2022-12-13 01:29:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:39,420 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-13 01:29:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969234247] [2022-12-13 01:29:39,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969234247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:29:39,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:29:39,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:29:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249366990] [2022-12-13 01:29:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:29:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:29:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:29:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:29:39,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:39,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:39,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:39,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:39,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:39,512 INFO L130 PetriNetUnfolder]: 221/328 cut-off events. [2022-12-13 01:29:39,512 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:29:39,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 328 events. 221/328 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 775 event pairs, 138 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 670. Up to 328 conditions per place. [2022-12-13 01:29:39,514 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 01:29:39,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 25 transitions, 116 flow [2022-12-13 01:29:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:29:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:29:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 01:29:39,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 01:29:39,515 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 3 states and 26 transitions. [2022-12-13 01:29:39,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 25 transitions, 116 flow [2022-12-13 01:29:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 106 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 01:29:39,517 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:39,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-13 01:29:39,517 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 01:29:39,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:29:39,518 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:39,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:29:39,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:39,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:39,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:39,524 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 01:29:39,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:29:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-13 01:29:39,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 01:29:39,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 01:29:41,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:29:41,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1928 [2022-12-13 01:29:41,446 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-13 01:29:41,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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-13 01:29:41,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:41,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:41,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:29:41,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash 102406865, now seen corresponding path program 1 times [2022-12-13 01:29:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452730431] [2022-12-13 01:29:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:41,795 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-13 01:29:41,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:41,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452730431] [2022-12-13 01:29:41,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452730431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:29:41,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:29:41,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:29:41,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900919346] [2022-12-13 01:29:41,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:29:41,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:29:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:41,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:29:41,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:29:41,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:41,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-13 01:29:41,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:41,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:41,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:41,970 INFO L130 PetriNetUnfolder]: 381/564 cut-off events. [2022-12-13 01:29:41,972 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:29:41,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 564 events. 381/564 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1742 event pairs, 138 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1149. Up to 328 conditions per place. [2022-12-13 01:29:41,974 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 2 changer transitions 17/53 dead transitions. [2022-12-13 01:29:41,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 53 transitions, 233 flow [2022-12-13 01:29:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:29:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:29:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 01:29:41,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 01:29:41,977 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 54 transitions. [2022-12-13 01:29:41,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 53 transitions, 233 flow [2022-12-13 01:29:41,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 53 transitions, 225 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:29:41,979 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 68 flow [2022-12-13 01:29:41,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-13 01:29:41,980 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2022-12-13 01:29:41,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:29:41,980 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 68 flow [2022-12-13 01:29:41,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:29:41,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:41,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-13 01:29:41,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-13 01:29:41,987 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 01:29:41,987 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:29:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-13 01:29:41,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-13 01:29:41,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 01:29:42,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:29:42,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 01:29:42,151 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-13 01:29:42,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-13 01:29:42,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:42,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:42,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:29:42,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2083465076, now seen corresponding path program 1 times [2022-12-13 01:29:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:42,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836631779] [2022-12-13 01:29:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:42,498 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-13 01:29:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836631779] [2022-12-13 01:29:42,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836631779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:29:42,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:29:42,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:29:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220665805] [2022-12-13 01:29:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:29:42,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:29:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:29:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:29:42,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:42,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 64 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-13 01:29:42,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:42,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:42,663 INFO L130 PetriNetUnfolder]: 365/538 cut-off events. [2022-12-13 01:29:42,688 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-13 01:29:42,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 538 events. 365/538 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1609 event pairs, 138 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1261. Up to 327 conditions per place. [2022-12-13 01:29:42,690 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 3 changer transitions 15/51 dead transitions. [2022-12-13 01:29:42,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 51 transitions, 242 flow [2022-12-13 01:29:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:29:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-13 01:29:42,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 01:29:42,692 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 5 states and 52 transitions. [2022-12-13 01:29:42,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 51 transitions, 242 flow [2022-12-13 01:29:42,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 51 transitions, 216 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 01:29:42,693 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2022-12-13 01:29:42,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2022-12-13 01:29:42,694 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-13 01:29:42,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:29:42,694 INFO L89 Accepts]: Start accepts. Operand has 30 places, 25 transitions, 70 flow [2022-12-13 01:29:42,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:29:42,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:42,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 25 transitions, 70 flow [2022-12-13 01:29:42,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 70 flow [2022-12-13 01:29:42,700 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 01:29:42,700 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:29:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-13 01:29:42,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 70 flow [2022-12-13 01:29:42,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 01:29:42,709 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 01:29:42,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:29:42,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 01:29:42,710 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 65 flow [2022-12-13 01:29:42,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-13 01:29:42,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:29:42,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:29:42,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:29:42,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:29:42,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:29:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 245064441, now seen corresponding path program 1 times [2022-12-13 01:29:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:29:42,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353750378] [2022-12-13 01:29:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:29:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:29:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:29:44,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353750378] [2022-12-13 01:29:44,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353750378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:29:44,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584867989] [2022-12-13 01:29:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:29:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:29:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:29:44,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:29:44,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:29:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:29:44,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 01:29:44,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:29:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:29:45,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-13 01:29:45,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:29:45,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 01:29:45,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 81 [2022-12-13 01:29:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:29:45,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:29:46,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 103 [2022-12-13 01:29:46,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-12-13 01:29:46,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-13 01:29:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:29:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584867989] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:29:46,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:29:46,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-13 01:29:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361715548] [2022-12-13 01:29:46,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:29:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 01:29:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:29:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 01:29:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1006, Unknown=16, NotChecked=0, Total=1122 [2022-12-13 01:29:46,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:29:46,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 65 flow. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 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-13 01:29:46,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:29:46,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:29:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:29:48,574 INFO L130 PetriNetUnfolder]: 213/351 cut-off events. [2022-12-13 01:29:48,574 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 01:29:48,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 351 events. 213/351 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1226 event pairs, 81 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 772. Up to 184 conditions per place. [2022-12-13 01:29:48,575 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 0 selfloop transitions, 0 changer transitions 56/56 dead transitions. [2022-12-13 01:29:48,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 56 transitions, 248 flow [2022-12-13 01:29:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:29:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:29:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 56 transitions. [2022-12-13 01:29:48,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:29:48,577 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 65 flow. Second operand 7 states and 56 transitions. [2022-12-13 01:29:48,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 56 transitions, 248 flow [2022-12-13 01:29:48,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 56 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 01:29:48,578 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2022-12-13 01:29:48,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2022-12-13 01:29:48,579 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-13 01:29:48,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:29:48,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 0 transitions, 0 flow [2022-12-13 01:29:48,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:29:48,580 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:29:48,580 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:29:48,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:29:48,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:29:48,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:29:48,580 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:29:48,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 01:29:48,581 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:29:48,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 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-13 01:29:48,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:29:48,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:29:48,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 01:29:48,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 01:29:48,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 01:29:48,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 01:29:48,790 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 01:29:48,792 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:29:48,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:29:48,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:29:48 BasicIcfg [2022-12-13 01:29:48,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:29:48,795 INFO L158 Benchmark]: Toolchain (without parser) took 29229.78ms. Allocated memory was 228.6MB in the beginning and 392.2MB in the end (delta: 163.6MB). Free memory was 187.9MB in the beginning and 178.8MB in the end (delta: 9.0MB). Peak memory consumption was 173.7MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,795 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 228.6MB. Free memory was 205.0MB in the beginning and 205.0MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:29:48,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.80ms. Allocated memory is still 228.6MB. Free memory was 187.4MB in the beginning and 174.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.30ms. Allocated memory is still 228.6MB. Free memory was 174.7MB in the beginning and 172.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,796 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 228.6MB. Free memory was 172.2MB in the beginning and 170.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,796 INFO L158 Benchmark]: RCFGBuilder took 611.51ms. Allocated memory is still 228.6MB. Free memory was 170.1MB in the beginning and 143.3MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,797 INFO L158 Benchmark]: TraceAbstraction took 28200.31ms. Allocated memory was 228.6MB in the beginning and 392.2MB in the end (delta: 163.6MB). Free memory was 142.3MB in the beginning and 178.8MB in the end (delta: -36.6MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. [2022-12-13 01:29:48,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 228.6MB. Free memory was 205.0MB in the beginning and 205.0MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.80ms. Allocated memory is still 228.6MB. Free memory was 187.4MB in the beginning and 174.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.30ms. Allocated memory is still 228.6MB. Free memory was 174.7MB in the beginning and 172.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 228.6MB. Free memory was 172.2MB in the beginning and 170.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 611.51ms. Allocated memory is still 228.6MB. Free memory was 170.1MB in the beginning and 143.3MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 28200.31ms. Allocated memory was 228.6MB in the beginning and 392.2MB in the end (delta: 163.6MB). Free memory was 142.3MB in the beginning and 178.8MB in the end (delta: -36.6MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.7s, 312 PlacesBefore, 30 PlacesAfterwards, 328 TransitionsBefore, 24 TransitionsAfterwards, 27528 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 111 TrivialYvCompositions, 171 ConcurrentYvCompositions, 22 ChoiceCompositions, 304 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 17605, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17613, independent: 17605, independent conditional: 0, independent unconditional: 17605, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15631, independent: 15623, independent conditional: 0, independent unconditional: 15623, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17613, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15631, unknown conditional: 0, unknown unconditional: 15631] , Statistics on independence cache: Total cache size (in pairs): 33839, Positive cache size: 33831, Positive conditional cache size: 0, Positive unconditional cache size: 33831, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 20, unknown conditional: 9, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 30, Positive conditional cache size: 8, Positive unconditional cache size: 22, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 30, Positive conditional cache size: 8, Positive unconditional cache size: 22, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 487 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1165 IncrementalHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 0 mSDtfsCounter, 1165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 155 ConstructedInterpolants, 4 QuantifiedInterpolants, 2199 SizeOfPredicates, 61 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 01:29:48,833 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...