/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/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:31:38,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:31:38,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:31:39,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:31:39,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:31:39,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:31:39,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:31:39,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:31:39,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:31:39,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:31:39,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:31:39,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:31:39,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:31:39,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:31:39,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:31:39,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:31:39,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:31:39,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:31:39,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:31:39,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:31:39,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:31:39,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:31:39,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:31:39,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:31:39,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:31:39,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:31:39,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:31:39,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:31:39,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:31:39,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:31:39,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:31:39,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:31:39,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:31:39,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:31:39,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:31:39,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:31:39,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:31:39,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:31:39,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:31:39,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:31:39,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:31:39,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:31:39,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:31:39,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:31:39,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:31:39,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:31:39,103 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:31:39,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:31:39,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:31:39,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:31:39,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:31:39,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:31:39,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:31:39,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:31:39,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:31:39,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:31:39,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:31:39,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:31:39,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:31:39,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:31:39,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:31:39,402 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:31:39,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-12-06 00:31:40,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:31:40,650 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:31:40,651 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-12-06 00:31:40,663 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5bb96f5/cb5beed7c6734deb903856b7096324ed/FLAGa1f814c9a [2022-12-06 00:31:40,673 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5bb96f5/cb5beed7c6734deb903856b7096324ed [2022-12-06 00:31:40,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:31:40,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:31:40,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:31:40,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:31:40,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:31:40,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:31:40" (1/1) ... [2022-12-06 00:31:40,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfc91bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:40, skipping insertion in model container [2022-12-06 00:31:40,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:31:40" (1/1) ... [2022-12-06 00:31:40,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:31:40,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:31:41,045 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-12-06 00:31:41,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:31:41,063 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:31:41,105 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-12-06 00:31:41,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:31:41,155 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:31:41,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41 WrapperNode [2022-12-06 00:31:41,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:31:41,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:31:41,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:31:41,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:31:41,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,214 INFO L138 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-12-06 00:31:41,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:31:41,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:31:41,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:31:41,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:31:41,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,241 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:31:41,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:31:41,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:31:41,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:31:41,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (1/1) ... [2022-12-06 00:31:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:31:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:41,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:31:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:31:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:31:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-06 00:31:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:31:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:31:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:31:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:31:41,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:31:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:31:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 00:31:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:31:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:31:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:31:41,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:31:41,323 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:31:41,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:31:41,487 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:31:41,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:31:41,753 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:31:41,758 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:31:41,758 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:31:41,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:31:41 BoogieIcfgContainer [2022-12-06 00:31:41,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:31:41,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:31:41,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:31:41,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:31:41,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:31:40" (1/3) ... [2022-12-06 00:31:41,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf6bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:31:41, skipping insertion in model container [2022-12-06 00:31:41,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:31:41" (2/3) ... [2022-12-06 00:31:41,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caf6bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:31:41, skipping insertion in model container [2022-12-06 00:31:41,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:31:41" (3/3) ... [2022-12-06 00:31:41,765 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-12-06 00:31:41,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:31:41,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:31:41,784 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:31:41,860 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:31:41,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 131 transitions, 278 flow [2022-12-06 00:31:41,960 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-06 00:31:41,961 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:31:41,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 10/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 3 conditions per place. [2022-12-06 00:31:41,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 131 transitions, 278 flow [2022-12-06 00:31:41,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 118 transitions, 248 flow [2022-12-06 00:31:41,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:41,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 118 transitions, 248 flow [2022-12-06 00:31:41,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 118 transitions, 248 flow [2022-12-06 00:31:42,034 INFO L130 PetriNetUnfolder]: 8/118 cut-off events. [2022-12-06 00:31:42,034 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:31:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 8/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 00:31:42,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 118 transitions, 248 flow [2022-12-06 00:31:42,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-06 00:31:42,193 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:42,196 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:42,213 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:42,214 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,096 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,097 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,099 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,100 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,232 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,234 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,236 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,237 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,690 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,691 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,693 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,694 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,948 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,948 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:44,951 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:44,951 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:45,303 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:45,304 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:45,307 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:45,307 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:47,206 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:47,207 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:47,210 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:47,211 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 00:31:48,253 INFO L203 LiptonReduction]: Total number of compositions: 93 [2022-12-06 00:31:48,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:31:48,286 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;@5cdf19b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:31:48,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:31:48,301 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 00:31:48,301 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:31:48,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:48,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:48,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash 228985984, now seen corresponding path program 1 times [2022-12-06 00:31:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991914278] [2022-12-06 00:31:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991914278] [2022-12-06 00:31:48,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991914278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:48,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:31:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915649017] [2022-12-06 00:31:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:48,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:31:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:31:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:31:48,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-06 00:31:48,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:48,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:48,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-06 00:31:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:48,677 INFO L130 PetriNetUnfolder]: 189/410 cut-off events. [2022-12-06 00:31:48,678 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 00:31:48,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 410 events. 189/410 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1851 event pairs, 72 based on Foata normal form. 24/368 useless extension candidates. Maximal degree in co-relation 672. Up to 194 conditions per place. [2022-12-06 00:31:48,686 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 00:31:48,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 167 flow [2022-12-06 00:31:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:31:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:31:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-06 00:31:48,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-06 00:31:48,696 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 74 flow. Second operand 3 states and 63 transitions. [2022-12-06 00:31:48,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 167 flow [2022-12-06 00:31:48,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:31:48,701 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2022-12-06 00:31:48,705 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-06 00:31:48,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:48,706 INFO L89 Accepts]: Start accepts. Operand has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:48,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:48,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,721 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2022-12-06 00:31:48,721 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:31:48,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 5/37 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2022-12-06 00:31:48,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 00:31:48,740 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:48,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 00:31:48,745 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 74 flow [2022-12-06 00:31:48,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:48,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:48,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:48,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:31:48,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:48,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1986141756, now seen corresponding path program 1 times [2022-12-06 00:31:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:48,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433287375] [2022-12-06 00:31:48,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433287375] [2022-12-06 00:31:48,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433287375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:48,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:48,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:31:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365911491] [2022-12-06 00:31:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:48,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:31:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:48,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:31:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:31:48,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-06 00:31:48,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:48,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:48,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-06 00:31:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:48,960 INFO L130 PetriNetUnfolder]: 297/632 cut-off events. [2022-12-06 00:31:48,960 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 00:31:48,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 632 events. 297/632 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3028 event pairs, 117 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 384. Up to 299 conditions per place. [2022-12-06 00:31:48,964 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-12-06 00:31:48,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 185 flow [2022-12-06 00:31:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:31:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:31:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 00:31:48,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-06 00:31:48,966 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 74 flow. Second operand 3 states and 59 transitions. [2022-12-06 00:31:48,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 185 flow [2022-12-06 00:31:48,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:31:48,968 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2022-12-06 00:31:48,969 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-06 00:31:48,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:48,969 INFO L89 Accepts]: Start accepts. Operand has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:48,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:48,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,976 INFO L130 PetriNetUnfolder]: 6/45 cut-off events. [2022-12-06 00:31:48,976 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:31:48,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 45 events. 6/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2022-12-06 00:31:48,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:31:48,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:48,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:31:48,984 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 84 flow [2022-12-06 00:31:48,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:48,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:48,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:48,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:31:48,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash 311444521, now seen corresponding path program 1 times [2022-12-06 00:31:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:48,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536272678] [2022-12-06 00:31:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536272678] [2022-12-06 00:31:49,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536272678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:49,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:49,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:31:49,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415003156] [2022-12-06 00:31:49,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:49,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:31:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:31:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:31:49,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-06 00:31:49,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:49,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:49,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-06 00:31:49,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:49,261 INFO L130 PetriNetUnfolder]: 285/664 cut-off events. [2022-12-06 00:31:49,261 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-06 00:31:49,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 664 events. 285/664 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3321 event pairs, 105 based on Foata normal form. 64/700 useless extension candidates. Maximal degree in co-relation 397. Up to 264 conditions per place. [2022-12-06 00:31:49,263 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 24 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2022-12-06 00:31:49,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 181 flow [2022-12-06 00:31:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:31:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:31:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 00:31:49,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 00:31:49,264 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 84 flow. Second operand 3 states and 54 transitions. [2022-12-06 00:31:49,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 181 flow [2022-12-06 00:31:49,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:31:49,266 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 102 flow [2022-12-06 00:31:49,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2022-12-06 00:31:49,266 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-06 00:31:49,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:49,266 INFO L89 Accepts]: Start accepts. Operand has 34 places, 31 transitions, 102 flow [2022-12-06 00:31:49,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:49,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:49,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 31 transitions, 102 flow [2022-12-06 00:31:49,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 102 flow [2022-12-06 00:31:49,274 INFO L130 PetriNetUnfolder]: 33/147 cut-off events. [2022-12-06 00:31:49,274 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 00:31:49,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 147 events. 33/147 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 566 event pairs, 9 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 220. Up to 33 conditions per place. [2022-12-06 00:31:49,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 31 transitions, 102 flow [2022-12-06 00:31:49,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 00:31:49,395 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 00:31:49,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 00:31:49,396 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 94 flow [2022-12-06 00:31:49,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:49,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:49,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:49,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:31:49,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1243613186, now seen corresponding path program 1 times [2022-12-06 00:31:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:49,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272255943] [2022-12-06 00:31:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272255943] [2022-12-06 00:31:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272255943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458890421] [2022-12-06 00:31:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:49,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:49,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:49,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:31:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:49,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 00:31:49,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458890421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:49,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:49,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 00:31:49,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731473023] [2022-12-06 00:31:49,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:49,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:31:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:31:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:31:49,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 00:31:49,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:49,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:49,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 00:31:49,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:49,715 INFO L130 PetriNetUnfolder]: 351/714 cut-off events. [2022-12-06 00:31:49,715 INFO L131 PetriNetUnfolder]: For 227/235 co-relation queries the response was YES. [2022-12-06 00:31:49,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 714 events. 351/714 cut-off events. For 227/235 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3401 event pairs, 65 based on Foata normal form. 48/758 useless extension candidates. Maximal degree in co-relation 558. Up to 178 conditions per place. [2022-12-06 00:31:49,718 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 55 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2022-12-06 00:31:49,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 65 transitions, 357 flow [2022-12-06 00:31:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:31:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:31:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 00:31:49,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2022-12-06 00:31:49,719 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 94 flow. Second operand 5 states and 83 transitions. [2022-12-06 00:31:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 65 transitions, 357 flow [2022-12-06 00:31:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 65 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:31:49,722 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 116 flow [2022-12-06 00:31:49,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 00:31:49,723 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-06 00:31:49,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:49,723 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 116 flow [2022-12-06 00:31:49,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:49,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:49,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 116 flow [2022-12-06 00:31:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 116 flow [2022-12-06 00:31:49,733 INFO L130 PetriNetUnfolder]: 55/179 cut-off events. [2022-12-06 00:31:49,733 INFO L131 PetriNetUnfolder]: For 46/50 co-relation queries the response was YES. [2022-12-06 00:31:49,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 179 events. 55/179 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 748 event pairs, 18 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 298. Up to 53 conditions per place. [2022-12-06 00:31:49,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 116 flow [2022-12-06 00:31:49,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:31:49,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_174| |v_~#m~0.base_103|))) (and (< v_thread1Thread1of1ForFork0_~i~0_63 3) (= (store |v_#pthreadsMutex_174| |v_~#m~0.base_103| (store .cse0 |v_~#m~0.offset_103| 1)) |v_#pthreadsMutex_173|) (= (select .cse0 |v_~#m~0.offset_103|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_174|, ~#m~0.base=|v_~#m~0.base_103|, ~#m~0.offset=|v_~#m~0.offset_103|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_63} OutVars{thread1Thread1of1ForFork0_#t~nondet4=|v_thread1Thread1of1ForFork0_#t~nondet4_19|, #pthreadsMutex=|v_#pthreadsMutex_173|, ~#m~0.base=|v_~#m~0.base_103|, ~#m~0.offset=|v_~#m~0.offset_103|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet4, #pthreadsMutex] and [402] L883-->L878-2: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_30 1) v_thread1Thread1of1ForFork0_~i~0_29) (= |v_#pthreadsMutex_83| (store |v_#pthreadsMutex_84| |v_~#m~0.base_55| (store (select |v_#pthreadsMutex_84| |v_~#m~0.base_55|) |v_~#m~0.offset_55| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_84|, ~#m~0.base=|v_~#m~0.base_55|, ~#m~0.offset=|v_~#m~0.offset_55|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_30} OutVars{#pthreadsMutex=|v_#pthreadsMutex_83|, ~#m~0.base=|v_~#m~0.base_55|, ~#m~0.offset=|v_~#m~0.offset_55|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_29, thread1Thread1of1ForFork0_#t~post7=|v_thread1Thread1of1ForFork0_#t~post7_17|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#t~post7] [2022-12-06 00:31:49,835 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:31:49,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 00:31:49,836 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 115 flow [2022-12-06 00:31:49,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:49,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:49,837 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:49,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:31:50,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:50,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash -544483674, now seen corresponding path program 1 times [2022-12-06 00:31:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:50,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975451721] [2022-12-06 00:31:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:31:50,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:50,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975451721] [2022-12-06 00:31:50,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975451721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:50,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118068197] [2022-12-06 00:31:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:50,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:50,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:31:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 00:31:50,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:31:50,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:31:50,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118068197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:50,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:31:50,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 00:31:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652479780] [2022-12-06 00:31:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:31:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:31:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:31:50,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 00:31:50,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 00:31:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:50,356 INFO L130 PetriNetUnfolder]: 356/641 cut-off events. [2022-12-06 00:31:50,356 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2022-12-06 00:31:50,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 641 events. 356/641 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2457 event pairs, 85 based on Foata normal form. 50/665 useless extension candidates. Maximal degree in co-relation 1128. Up to 347 conditions per place. [2022-12-06 00:31:50,359 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-12-06 00:31:50,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 247 flow [2022-12-06 00:31:50,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:31:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:31:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 00:31:50,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2022-12-06 00:31:50,361 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 115 flow. Second operand 4 states and 46 transitions. [2022-12-06 00:31:50,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 247 flow [2022-12-06 00:31:50,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 239 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 00:31:50,366 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 143 flow [2022-12-06 00:31:50,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-06 00:31:50,370 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-06 00:31:50,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:50,371 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 143 flow [2022-12-06 00:31:50,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:50,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:50,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 143 flow [2022-12-06 00:31:50,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 143 flow [2022-12-06 00:31:50,384 INFO L130 PetriNetUnfolder]: 47/147 cut-off events. [2022-12-06 00:31:50,384 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-06 00:31:50,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 147 events. 47/147 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 460 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 334. Up to 52 conditions per place. [2022-12-06 00:31:50,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 143 flow [2022-12-06 00:31:50,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 00:31:50,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:50,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 00:31:50,418 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 141 flow [2022-12-06 00:31:50,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:50,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:50,418 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:50,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:31:50,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:50,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 818737340, now seen corresponding path program 1 times [2022-12-06 00:31:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:50,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818057611] [2022-12-06 00:31:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818057611] [2022-12-06 00:31:50,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818057611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241430935] [2022-12-06 00:31:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:50,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:50,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:31:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:50,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:31:50,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:50,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:50,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241430935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:50,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:50,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-12-06 00:31:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307152180] [2022-12-06 00:31:50,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:50,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:31:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:31:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:31:50,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:31:50,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:50,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:50,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:31:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:50,985 INFO L130 PetriNetUnfolder]: 488/869 cut-off events. [2022-12-06 00:31:50,985 INFO L131 PetriNetUnfolder]: For 763/763 co-relation queries the response was YES. [2022-12-06 00:31:50,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 869 events. 488/869 cut-off events. For 763/763 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3569 event pairs, 109 based on Foata normal form. 72/941 useless extension candidates. Maximal degree in co-relation 1772. Up to 306 conditions per place. [2022-12-06 00:31:50,989 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 55 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-12-06 00:31:50,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 63 transitions, 467 flow [2022-12-06 00:31:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:31:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:31:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 00:31:50,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 00:31:50,991 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 141 flow. Second operand 5 states and 58 transitions. [2022-12-06 00:31:50,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 63 transitions, 467 flow [2022-12-06 00:31:50,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:31:50,994 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:50,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-06 00:31:50,996 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2022-12-06 00:31:50,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:50,996 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:50,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:50,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:50,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:50,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:51,011 INFO L130 PetriNetUnfolder]: 87/237 cut-off events. [2022-12-06 00:31:51,011 INFO L131 PetriNetUnfolder]: For 314/323 co-relation queries the response was YES. [2022-12-06 00:31:51,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 237 events. 87/237 cut-off events. For 314/323 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 945 event pairs, 0 based on Foata normal form. 3/240 useless extension candidates. Maximal degree in co-relation 654. Up to 88 conditions per place. [2022-12-06 00:31:51,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:51,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 00:31:51,015 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:51,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 00:31:51,016 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 194 flow [2022-12-06 00:31:51,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:51,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:51,016 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:51,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:51,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -151814173, now seen corresponding path program 2 times [2022-12-06 00:31:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821606650] [2022-12-06 00:31:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:31:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:51,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821606650] [2022-12-06 00:31:51,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821606650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:51,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114830738] [2022-12-06 00:31:51,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:31:51,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:51,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:51,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 00:31:51,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:31:51,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:31:51,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:31:51,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 00:31:51,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-06 00:31:51,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114830738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:51,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:51,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-12-06 00:31:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902763870] [2022-12-06 00:31:51,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:51,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:31:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:31:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:31:51,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:31:51,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:51,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:51,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:31:51,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:51,684 INFO L130 PetriNetUnfolder]: 155/304 cut-off events. [2022-12-06 00:31:51,684 INFO L131 PetriNetUnfolder]: For 499/499 co-relation queries the response was YES. [2022-12-06 00:31:51,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 304 events. 155/304 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 911 event pairs, 50 based on Foata normal form. 34/338 useless extension candidates. Maximal degree in co-relation 588. Up to 175 conditions per place. [2022-12-06 00:31:51,686 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 29 selfloop transitions, 7 changer transitions 1/37 dead transitions. [2022-12-06 00:31:51,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 272 flow [2022-12-06 00:31:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:31:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:31:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 00:31:51,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 00:31:51,688 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 194 flow. Second operand 4 states and 38 transitions. [2022-12-06 00:31:51,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 272 flow [2022-12-06 00:31:51,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 265 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 00:31:51,691 INFO L231 Difference]: Finished difference. Result has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2022-12-06 00:31:51,691 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2022-12-06 00:31:51,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:51,691 INFO L89 Accepts]: Start accepts. Operand has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:51,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:51,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,698 INFO L130 PetriNetUnfolder]: 18/74 cut-off events. [2022-12-06 00:31:51,698 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-06 00:31:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 74 events. 18/74 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 141 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 178. Up to 21 conditions per place. [2022-12-06 00:31:51,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 00:31:51,699 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:51,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 00:31:51,700 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 156 flow [2022-12-06 00:31:51,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:51,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:51,700 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:51,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:51,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:51,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1581957473, now seen corresponding path program 3 times [2022-12-06 00:31:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528028351] [2022-12-06 00:31:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:31:51,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 00:31:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:31:51,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 00:31:51,959 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 00:31:51,960 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:31:51,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:31:51,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:31:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:31:51,961 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-06 00:31:51,965 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:31:51,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:31:51,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:31:51 BasicIcfg [2022-12-06 00:31:51,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:31:51,997 INFO L158 Benchmark]: Toolchain (without parser) took 11322.05ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 163.7MB in the beginning and 206.0MB in the end (delta: -42.3MB). Peak memory consumption was 101.9MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.44ms. Allocated memory is still 189.8MB. Free memory was 163.7MB in the beginning and 137.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.61ms. Allocated memory is still 189.8MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: Boogie Preprocessor took 36.32ms. Allocated memory is still 189.8MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: RCFGBuilder took 505.24ms. Allocated memory is still 189.8MB. Free memory was 132.8MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,998 INFO L158 Benchmark]: TraceAbstraction took 10236.02ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 115.0MB in the beginning and 206.0MB in the end (delta: -91.1MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. [2022-12-06 00:31:51,999 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.44ms. Allocated memory is still 189.8MB. Free memory was 163.7MB in the beginning and 137.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.61ms. Allocated memory is still 189.8MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.32ms. Allocated memory is still 189.8MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 505.24ms. Allocated memory is still 189.8MB. Free memory was 132.8MB in the beginning and 116.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10236.02ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 115.0MB in the beginning and 206.0MB in the end (delta: -91.1MB). Peak memory consumption was 53.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 117 PlacesBefore, 32 PlacesAfterwards, 118 TransitionsBefore, 31 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1442, independent: 1373, independent conditional: 1373, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1442, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1442, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1442, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1167, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1167, independent: 1115, independent conditional: 0, independent unconditional: 1115, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, independent: 234, independent conditional: 0, independent unconditional: 234, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 1167, unknown conditional: 0, unknown unconditional: 1167] , Statistics on independence cache: Total cache size (in pairs): 1782, Positive cache size: 1754, Positive conditional cache size: 0, Positive unconditional cache size: 1754, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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, 31 PlacesBefore, 31 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 129, independent conditional: 4, independent unconditional: 125, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 129, independent conditional: 4, independent unconditional: 125, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 129, independent conditional: 4, independent unconditional: 125, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 133, independent: 114, independent conditional: 4, independent unconditional: 110, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 133, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 133, unknown conditional: 5, unknown unconditional: 128] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 114, Positive conditional cache size: 4, Positive unconditional cache size: 110, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 5, independent unconditional: 120, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 125, independent conditional: 5, independent unconditional: 120, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 125, independent conditional: 5, independent unconditional: 120, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 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] ], Cache Queries: [ total: 149, independent: 125, independent conditional: 5, independent unconditional: 120, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 114, Positive conditional cache size: 4, Positive unconditional cache size: 110, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 34 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 35, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 156, Positive conditional cache size: 4, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 178, Positive conditional cache size: 4, Positive unconditional cache size: 174, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 36 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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): 198, Positive cache size: 178, Positive conditional cache size: 4, Positive unconditional cache size: 174, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 150 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): 198, Positive cache size: 178, Positive conditional cache size: 4, Positive unconditional cache size: 174, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 43 PlacesBefore, 43 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 92 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): 198, Positive cache size: 178, Positive conditional cache size: 4, Positive unconditional cache size: 174, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=-1, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=0, t1={7:0}, t2={6:0}, total=0] [L878] COND TRUE 1 i < 3 [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L915] 0 \read(t1) VAL [\read(t1)=-1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-1, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L916] 0 \read(t2) VAL [\read(t2)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 167 locations, 3 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: 10.1s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 0 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 13 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=6, InterpolantAutomatonStates: 27, 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.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 85/122 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 00:31:52,015 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...