/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/goblint-regression/13-privatized_20-publish-regression_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:31,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:31,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:31,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:31,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:31,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:31,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:31,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:31,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:31,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:31,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:31,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:31,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:31,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:31,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:31,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:31,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:31,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:31,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:31,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:31,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:31,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:31,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:31,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:31,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:31,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:31,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:31,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:31,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:31,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:31,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:31,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:31,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:31,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:31,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:31,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:31,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:31,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:31,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:31,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:31,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:31,286 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-05 23:42:31,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:31,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:31,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:31,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:31,318 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:31,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:31,318 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:31,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:31,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:31,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:31,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:31,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:31,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:31,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:31,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:31,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:31,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:31,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:31,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:31,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:31,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:31,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:31,322 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-05 23:42:31,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:31,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:31,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:31,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:31,613 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:31,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i [2022-12-05 23:42:32,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:33,128 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:33,129 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i [2022-12-05 23:42:33,149 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6966efd9c/d525ab86ceee4965972a75bf71c29fc3/FLAG0f44bf169 [2022-12-05 23:42:33,168 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6966efd9c/d525ab86ceee4965972a75bf71c29fc3 [2022-12-05 23:42:33,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:33,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:33,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:33,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:33,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:33,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62db8589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33, skipping insertion in model container [2022-12-05 23:42:33,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:33,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:33,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i[1095,1108] [2022-12-05 23:42:33,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:33,559 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:33,570 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i[1095,1108] [2022-12-05 23:42:33,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:33,644 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:33,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33 WrapperNode [2022-12-05 23:42:33,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:33,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:33,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:33,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:33,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,706 INFO L138 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-12-05 23:42:33,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:33,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:33,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:33,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:33,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:33,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:33,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:33,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:33,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (1/1) ... [2022-12-05 23:42:33,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:33,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:33,773 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-05 23:42:33,792 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-05 23:42:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:42:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 23:42:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 23:42:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:33,822 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:42:33,957 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:33,959 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:34,165 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:34,171 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:34,172 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:34,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:34 BoogieIcfgContainer [2022-12-05 23:42:34,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:34,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:34,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:34,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:34,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:33" (1/3) ... [2022-12-05 23:42:34,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de376b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:34, skipping insertion in model container [2022-12-05 23:42:34,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:33" (2/3) ... [2022-12-05 23:42:34,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de376b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:34, skipping insertion in model container [2022-12-05 23:42:34,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:34" (3/3) ... [2022-12-05 23:42:34,185 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_20-publish-regression_true.i [2022-12-05 23:42:34,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:34,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-05 23:42:34,203 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:34,269 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:42:34,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 170 flow [2022-12-05 23:42:34,334 INFO L130 PetriNetUnfolder]: 3/80 cut-off events. [2022-12-05 23:42:34,334 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:34,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 80 events. 3/80 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-05 23:42:34,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 170 flow [2022-12-05 23:42:34,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 73 transitions, 149 flow [2022-12-05 23:42:34,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:34,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 73 transitions, 149 flow [2022-12-05 23:42:34,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 73 transitions, 149 flow [2022-12-05 23:42:34,400 INFO L130 PetriNetUnfolder]: 3/73 cut-off events. [2022-12-05 23:42:34,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:34,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 73 events. 3/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2022-12-05 23:42:34,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 73 transitions, 149 flow [2022-12-05 23:42:34,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-05 23:42:37,743 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-05 23:42:37,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:37,762 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;@d4a49fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:37,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:42:37,763 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:37,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:37,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:37,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:42:37,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:42:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 313, now seen corresponding path program 1 times [2022-12-05 23:42:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:37,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187339774] [2022-12-05 23:42:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:42:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187339774] [2022-12-05 23:42:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187339774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:42:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443299858] [2022-12-05 23:42:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:37,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:37,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-05 23:42:37,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 23:42:37,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:37,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-05 23:42:37,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:37,925 INFO L130 PetriNetUnfolder]: 30/90 cut-off events. [2022-12-05 23:42:37,926 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:37,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 90 events. 30/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 279 event pairs, 30 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 159. Up to 74 conditions per place. [2022-12-05 23:42:37,927 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2022-12-05 23:42:37,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 63 flow [2022-12-05 23:42:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-12-05 23:42:37,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-05 23:42:37,938 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 47 flow. Second operand 2 states and 26 transitions. [2022-12-05 23:42:37,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 63 flow [2022-12-05 23:42:37,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 62 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:37,942 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 36 flow [2022-12-05 23:42:37,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=36, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2022-12-05 23:42:37,946 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2022-12-05 23:42:37,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:37,947 INFO L89 Accepts]: Start accepts. Operand has 21 places, 17 transitions, 36 flow [2022-12-05 23:42:37,949 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:37,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:37,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 17 transitions, 36 flow [2022-12-05 23:42:37,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 36 flow [2022-12-05 23:42:37,955 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:42:37,955 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:37,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:37,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 17 transitions, 36 flow [2022-12-05 23:42:37,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-05 23:42:37,994 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:37,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-05 23:42:37,996 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 36 flow [2022-12-05 23:42:37,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 23:42:37,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:37,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:37,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:42:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 9554098, now seen corresponding path program 1 times [2022-12-05 23:42:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:37,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419332592] [2022-12-05 23:42:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:38,190 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-05 23:42:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:38,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419332592] [2022-12-05 23:42:38,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419332592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:38,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:38,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372349868] [2022-12-05 23:42:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:38,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:38,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-05 23:42:38,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:42:38,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:38,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-05 23:42:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:38,247 INFO L130 PetriNetUnfolder]: 30/88 cut-off events. [2022-12-05 23:42:38,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:38,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 88 events. 30/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 264 event pairs, 18 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 160. Up to 44 conditions per place. [2022-12-05 23:42:38,249 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 15 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2022-12-05 23:42:38,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 21 transitions, 80 flow [2022-12-05 23:42:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:42:38,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2022-12-05 23:42:38,253 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 36 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:42:38,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 21 transitions, 80 flow [2022-12-05 23:42:38,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:38,255 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 45 flow [2022-12-05 23:42:38,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=45, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 23:42:38,256 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2022-12-05 23:42:38,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:38,256 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 45 flow [2022-12-05 23:42:38,256 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:38,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:38,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 45 flow [2022-12-05 23:42:38,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 16 transitions, 45 flow [2022-12-05 23:42:38,263 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:42:38,263 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:42:38,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 0/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:38,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 16 transitions, 45 flow [2022-12-05 23:42:38,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:42:38,270 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:38,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:42:38,271 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 45 flow [2022-12-05 23:42:38,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:42:38,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:38,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:38,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:38,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:42:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1157843341, now seen corresponding path program 1 times [2022-12-05 23:42:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:38,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004054863] [2022-12-05 23:42:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:38,396 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-05 23:42:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004054863] [2022-12-05 23:42:38,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004054863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:38,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:38,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431142300] [2022-12-05 23:42:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:38,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-05 23:42:38,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 45 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:42:38,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:38,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-05 23:42:38,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:38,474 INFO L130 PetriNetUnfolder]: 28/83 cut-off events. [2022-12-05 23:42:38,474 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:42:38,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 83 events. 28/83 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 243 event pairs, 12 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 174. Up to 47 conditions per place. [2022-12-05 23:42:38,475 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 13 selfloop transitions, 5 changer transitions 5/24 dead transitions. [2022-12-05 23:42:38,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 110 flow [2022-12-05 23:42:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:42:38,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:42:38,476 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 45 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:42:38,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 110 flow [2022-12-05 23:42:38,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:38,477 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 56 flow [2022-12-05 23:42:38,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 23:42:38,478 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2022-12-05 23:42:38,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:38,478 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 56 flow [2022-12-05 23:42:38,479 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:38,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:38,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 56 flow [2022-12-05 23:42:38,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 56 flow [2022-12-05 23:42:38,483 INFO L130 PetriNetUnfolder]: 1/29 cut-off events. [2022-12-05 23:42:38,483 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:42:38,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 29 events. 1/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 48. Up to 9 conditions per place. [2022-12-05 23:42:38,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 56 flow [2022-12-05 23:42:38,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-05 23:42:38,706 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:42:38,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-05 23:42:38,707 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 12 transitions, 47 flow [2022-12-05 23:42:38,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 23:42:38,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:38,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:38,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:38,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:42:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 9556170, now seen corresponding path program 1 times [2022-12-05 23:42:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851970870] [2022-12-05 23:42:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:38,753 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-05 23:42:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:38,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851970870] [2022-12-05 23:42:38,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851970870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:38,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:38,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239143104] [2022-12-05 23:42:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:38,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:38,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:42:38,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 12 transitions, 47 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:42:38,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:38,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:42:38,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:38,778 INFO L130 PetriNetUnfolder]: 12/39 cut-off events. [2022-12-05 23:42:38,778 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-05 23:42:38,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 39 events. 12/39 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 110 event pairs, 6 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 105. Up to 21 conditions per place. [2022-12-05 23:42:38,779 INFO L137 encePairwiseOnDemand]: 9/12 looper letters, 5 selfloop transitions, 2 changer transitions 8/15 dead transitions. [2022-12-05 23:42:38,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 89 flow [2022-12-05 23:42:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-12-05 23:42:38,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 23:42:38,780 INFO L175 Difference]: Start difference. First operand has 19 places, 12 transitions, 47 flow. Second operand 3 states and 16 transitions. [2022-12-05 23:42:38,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 89 flow [2022-12-05 23:42:38,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 15 transitions, 87 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:38,781 INFO L231 Difference]: Finished difference. Result has 20 places, 7 transitions, 33 flow [2022-12-05 23:42:38,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=33, PETRI_PLACES=20, PETRI_TRANSITIONS=7} [2022-12-05 23:42:38,782 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, -4 predicate places. [2022-12-05 23:42:38,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:38,782 INFO L89 Accepts]: Start accepts. Operand has 20 places, 7 transitions, 33 flow [2022-12-05 23:42:38,782 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:38,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:38,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 7 transitions, 33 flow [2022-12-05 23:42:38,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 7 transitions, 33 flow [2022-12-05 23:42:38,785 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:42:38,785 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:42:38,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 8 events. 0/8 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 5 event pairs, 0 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:42:38,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 7 transitions, 33 flow [2022-12-05 23:42:38,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-05 23:42:38,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [299] L699-3-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_707| |v_~#mutex1~0.base_241|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_224| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_190| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_224|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_190| (ite (= v_~glob1~0_252 0) 1 0)) (= (store |v_#pthreadsMutex_707| |v_~#mutex1~0.base_241| (store .cse0 |v_~#mutex1~0.offset_241| 1)) |v_#pthreadsMutex_706|) (= (select .cse0 |v_~#mutex1~0.offset_241|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_707|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_241|, ~#mutex1~0.base=|v_~#mutex1~0.base_241|, ~glob1~0=v_~glob1~0_252} OutVars{#pthreadsMutex=|v_#pthreadsMutex_706|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_190|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_241|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_105|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_136|, ~#mutex1~0.base=|v_~#mutex1~0.base_241|, ~glob1~0=v_~glob1~0_252, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_224|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_129|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start___VERIFIER_assert_~cond#1, ULTIMATE.start_main_#t~pre4#1] and [303] L689-->t_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_732| |v_~#mutex2~0.base_198|))) (and (= (ite (= 5 v_~glob1~0_265) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_152|) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_135| 0)) (= (select .cse0 |v_~#mutex2~0.offset_198|) 0) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_135| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_152|) (= (let ((.cse1 (let ((.cse2 (store |v_#pthreadsMutex_732| |v_~#mutex2~0.base_198| (store .cse0 |v_~#mutex2~0.offset_198| 1)))) (store .cse2 |v_~#mutex1~0.base_249| (store (select .cse2 |v_~#mutex1~0.base_249|) |v_~#mutex1~0.offset_249| 0))))) (store .cse1 |v_~#mutex2~0.base_198| (store (select .cse1 |v_~#mutex2~0.base_198|) |v_~#mutex2~0.offset_198| 0))) |v_#pthreadsMutex_730|) (= |v_t_funThread1of1ForFork0_#res#1.offset_59| 0) (= |v_t_funThread1of1ForFork0_#res#1.base_59| 0) (= v_~glob1~0_264 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_732|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_249|, ~#mutex1~0.base=|v_~#mutex1~0.base_249|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_198|, ~glob1~0=v_~glob1~0_265, ~#mutex2~0.base=|v_~#mutex2~0.base_198|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_59|, #pthreadsMutex=|v_#pthreadsMutex_730|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_152|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_249|, ~#mutex1~0.base=|v_~#mutex1~0.base_249|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_144|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_59|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_198|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_135|, ~glob1~0=v_~glob1~0_264, ~#mutex2~0.base=|v_~#mutex2~0.base_198|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, ~glob1~0] [2022-12-05 23:42:39,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_720| |v_~#mutex1~0.base_245|))) (let ((.cse0 (store |v_#pthreadsMutex_720| |v_~#mutex1~0.base_245| (store .cse2 |v_~#mutex1~0.offset_245| 1)))) (let ((.cse1 (select .cse0 |v_~#mutex2~0.base_194|))) (and (= (store .cse0 |v_~#mutex2~0.base_194| (store .cse1 |v_~#mutex2~0.offset_194| 0)) |v_#pthreadsMutex_718|) (= 0 (select .cse2 |v_~#mutex1~0.offset_245|)) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_29| |v_t_funThread1of1ForFork0_~arg#1.base_33|) (= 5 v_~glob1~0_260) (= |v_t_funThread1of1ForFork0_~arg#1.offset_33| |v_t_funThread1of1ForFork0_#in~arg#1.offset_29|) (= (select .cse1 |v_~#mutex2~0.offset_194|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_720|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_29|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_245|, ~#mutex1~0.base=|v_~#mutex1~0.base_245|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_29|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_194|, ~#mutex2~0.base=|v_~#mutex2~0.base_194|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_718|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_47|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_29|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_245|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_33|, ~#mutex1~0.base=|v_~#mutex1~0.base_245|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_33|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_29|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_194|, ~glob1~0=v_~glob1~0_260, ~#mutex2~0.base=|v_~#mutex2~0.base_194|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_63|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, ~glob1~0, t_funThread1of1ForFork0_#t~nondet2#1] and [304] L699-3-->t_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_738| |v_~#mutex1~0.base_251|))) (let ((.cse3 (store |v_#pthreadsMutex_738| |v_~#mutex1~0.base_251| (store .cse0 |v_~#mutex1~0.offset_251| 1)))) (let ((.cse4 (select .cse3 |v_~#mutex2~0.base_200|))) (and (= (select .cse0 |v_~#mutex1~0.offset_251|) 0) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_154| (ite (= 5 v_~glob1~0_269) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_194| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_228|) (= (let ((.cse1 (let ((.cse2 (store .cse3 |v_~#mutex2~0.base_200| (store .cse4 |v_~#mutex2~0.offset_200| 1)))) (store .cse2 |v_~#mutex1~0.base_251| (store (select .cse2 |v_~#mutex1~0.base_251|) |v_~#mutex1~0.offset_251| 0))))) (store .cse1 |v_~#mutex2~0.base_200| (store (select .cse1 |v_~#mutex2~0.base_200|) |v_~#mutex2~0.offset_200| 0))) |v_#pthreadsMutex_736|) (= |v_t_funThread1of1ForFork0_#res#1.base_61| 0) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_137| 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_137| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_154|) (= v_~glob1~0_268 0) (= |v_t_funThread1of1ForFork0_#res#1.offset_61| 0) (= (select .cse4 |v_~#mutex2~0.offset_200|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_194| (ite (= v_~glob1~0_269 0) 1 0)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_738|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_251|, ~#mutex1~0.base=|v_~#mutex1~0.base_251|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_200|, ~glob1~0=v_~glob1~0_269, ~#mutex2~0.base=|v_~#mutex2~0.base_200|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_61|, #pthreadsMutex=|v_#pthreadsMutex_736|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_251|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_194|, ~#mutex1~0.base=|v_~#mutex1~0.base_251|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_138|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_131|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_154|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_107|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_146|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_61|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_200|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_137|, ~glob1~0=v_~glob1~0_268, ~#mutex2~0.base=|v_~#mutex2~0.base_200|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_228|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, #pthreadsMutex, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, ~glob1~0, ULTIMATE.start___VERIFIER_assert_~cond#1, ULTIMATE.start_main_#t~pre4#1] [2022-12-05 23:42:39,114 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:42:39,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-05 23:42:39,117 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 5 transitions, 31 flow [2022-12-05 23:42:39,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:42:39,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:39,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:39,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:39,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:42:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash 9556204, now seen corresponding path program 1 times [2022-12-05 23:42:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:39,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363135620] [2022-12-05 23:42:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:39,244 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-05 23:42:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:39,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363135620] [2022-12-05 23:42:39,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363135620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:39,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:39,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48069115] [2022-12-05 23:42:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:39,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:39,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 5 [2022-12-05 23:42:39,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 5 transitions, 31 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:42:39,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:39,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 5 [2022-12-05 23:42:39,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:39,260 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 23:42:39,260 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:42:39,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 3 events. 0/3 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 2/5 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:42:39,260 INFO L137 encePairwiseOnDemand]: 1/5 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-05 23:42:39,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 3 transitions, 20 flow [2022-12-05 23:42:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-12-05 23:42:39,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 23:42:39,261 INFO L175 Difference]: Start difference. First operand has 14 places, 5 transitions, 31 flow. Second operand 4 states and 5 transitions. [2022-12-05 23:42:39,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 3 transitions, 20 flow [2022-12-05 23:42:39,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 3 transitions, 15 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:39,262 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2022-12-05 23:42:39,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=5, PETRI_DIFFERENCE_MINUEND_FLOW=9, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=11, PETRI_TRANSITIONS=0} [2022-12-05 23:42:39,262 INFO L294 CegarLoopForPetriNet]: 24 programPoint places, -13 predicate places. [2022-12-05 23:42:39,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:39,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 0 transitions, 0 flow [2022-12-05 23:42:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:39,263 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:39,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:39,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-05 23:42:39,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:39,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:39,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:39,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:42:39,265 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:39,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-05 23:42:39,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:42:39,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:42:39,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:42:39,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-05 23:42:39,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:42:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:42:39,268 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-05 23:42:39,272 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:39,272 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:39,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:39 BasicIcfg [2022-12-05 23:42:39,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:39,275 INFO L158 Benchmark]: Toolchain (without parser) took 6103.51ms. Allocated memory was 226.5MB in the beginning and 274.7MB in the end (delta: 48.2MB). Free memory was 201.2MB in the beginning and 156.0MB in the end (delta: 45.1MB). Peak memory consumption was 94.2MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,276 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory was 203.1MB in the beginning and 203.0MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:39,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.01ms. Allocated memory is still 226.5MB. Free memory was 201.2MB in the beginning and 182.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.81ms. Allocated memory is still 226.5MB. Free memory was 182.1MB in the beginning and 180.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,276 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 226.5MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,277 INFO L158 Benchmark]: RCFGBuilder took 434.68ms. Allocated memory is still 226.5MB. Free memory was 178.4MB in the beginning and 165.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,277 INFO L158 Benchmark]: TraceAbstraction took 5095.32ms. Allocated memory was 226.5MB in the beginning and 274.7MB in the end (delta: 48.2MB). Free memory was 164.8MB in the beginning and 156.0MB in the end (delta: 8.7MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. [2022-12-05 23:42:39,278 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory was 203.1MB in the beginning and 203.0MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.01ms. Allocated memory is still 226.5MB. Free memory was 201.2MB in the beginning and 182.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.81ms. Allocated memory is still 226.5MB. Free memory was 182.1MB in the beginning and 180.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 226.5MB. Free memory was 180.0MB in the beginning and 178.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 434.68ms. Allocated memory is still 226.5MB. Free memory was 178.4MB in the beginning and 165.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5095.32ms. Allocated memory was 226.5MB in the beginning and 274.7MB in the end (delta: 48.2MB). Free memory was 164.8MB in the beginning and 156.0MB in the end (delta: 8.7MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 74 PlacesBefore, 24 PlacesAfterwards, 73 TransitionsBefore, 22 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 6 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 21 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1306, independent: 1153, independent conditional: 1153, independent unconditional: 0, dependent: 153, dependent conditional: 153, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1306, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1306, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1306, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 549, independent: 514, independent conditional: 0, independent unconditional: 514, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 549, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1306, independent: 639, independent conditional: 0, independent unconditional: 639, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 549, unknown conditional: 0, unknown unconditional: 549] , Statistics on independence cache: Total cache size (in pairs): 1408, Positive cache size: 1373, Positive conditional cache size: 0, Positive unconditional cache size: 1373, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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, 20 PlacesBefore, 20 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 54, independent conditional: 54, 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: 76, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 22 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 23 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 77, Positive conditional cache size: 2, Positive unconditional cache size: 75, 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.3s, 16 PlacesBefore, 14 PlacesAfterwards, 7 TransitionsBefore, 5 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 99, Positive cache size: 79, Positive conditional cache size: 2, Positive unconditional cache size: 77, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 79, Positive conditional cache size: 2, Positive unconditional cache size: 77, 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 102 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, InterpolantAutomatonStates: 15, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:39,302 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...