/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:59:14,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:59:14,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:59:14,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:59:14,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:59:14,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:59:14,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:59:14,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:59:14,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:59:14,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:59:14,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:59:14,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:59:14,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:59:14,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:59:14,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:59:14,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:59:14,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:59:14,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:59:14,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:59:14,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:59:14,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:59:14,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:59:14,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:59:14,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:59:14,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:59:14,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:59:14,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:59:14,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:59:14,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:59:14,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:59:14,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:59:14,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:59:14,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:59:14,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:59:14,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:59:14,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:59:14,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:59:14,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:59:14,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:59:14,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:59:14,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:59:14,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:59:14,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:59:14,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:59:14,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:59:14,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:59:14,116 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:59:14,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:59:14,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:59:14,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:59:14,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:59:14,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:59:14,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:59:14,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:59:14,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:59:14,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:59:14,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:59:14,397 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:59:14,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i [2022-12-13 09:59:15,386 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:59:15,664 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:59:15,665 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_38-traces-ex-4-switch_true.i [2022-12-13 09:59:15,709 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be752b6b9/b2d9e7d7e2fb435cb90268e5744f9e1a/FLAGc3a9d881c [2022-12-13 09:59:15,724 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be752b6b9/b2d9e7d7e2fb435cb90268e5744f9e1a [2022-12-13 09:59:15,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:59:15,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:59:15,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:59:15,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:59:15,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:59:15,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:59:15" (1/1) ... [2022-12-13 09:59:15,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbf12a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:15, skipping insertion in model container [2022-12-13 09:59:15,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:59:15" (1/1) ... [2022-12-13 09:59:15,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:59:15,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:59:15,914 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_38-traces-ex-4-switch_true.i[1095,1108] [2022-12-13 09:59:16,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:59:16,058 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:59:16,071 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_38-traces-ex-4-switch_true.i[1095,1108] [2022-12-13 09:59:16,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:59:16,137 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:59:16,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16 WrapperNode [2022-12-13 09:59:16,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:59:16,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:59:16,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:59:16,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:59:16,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,182 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-13 09:59:16,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:59:16,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:59:16,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:59:16,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:59:16,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,208 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:59:16,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:59:16,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:59:16,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:59:16,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (1/1) ... [2022-12-13 09:59:16,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:59:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:59:16,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:59:16,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:59:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 09:59:16,273 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:59:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:59:16,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:59:16,274 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:59:16,381 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:59:16,382 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:59:16,534 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:59:16,538 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:59:16,538 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:59:16,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:59:16 BoogieIcfgContainer [2022-12-13 09:59:16,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:59:16,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:59:16,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:59:16,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:59:16,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:59:15" (1/3) ... [2022-12-13 09:59:16,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b9a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:59:16, skipping insertion in model container [2022-12-13 09:59:16,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:16" (2/3) ... [2022-12-13 09:59:16,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665b9a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:59:16, skipping insertion in model container [2022-12-13 09:59:16,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:59:16" (3/3) ... [2022-12-13 09:59:16,544 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_38-traces-ex-4-switch_true.i [2022-12-13 09:59:16,589 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:59:16,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:59:16,589 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:59:16,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:59:16,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 135 flow [2022-12-13 09:59:16,714 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-12-13 09:59:16,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:16,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 1/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-13 09:59:16,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 135 flow [2022-12-13 09:59:16,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 54 transitions, 111 flow [2022-12-13 09:59:16,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:16,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-13 09:59:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 111 flow [2022-12-13 09:59:16,770 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-13 09:59:16,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 09:59:16,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 54 transitions, 111 flow [2022-12-13 09:59:16,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 09:59:18,787 INFO L241 LiptonReduction]: Total number of compositions: 46 [2022-12-13 09:59:18,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:59:18,812 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;@3d7d7b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:59:18,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 09:59:18,815 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 09:59:18,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:18,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:18,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:59:18,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 218906972, now seen corresponding path program 1 times [2022-12-13 09:59:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:18,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126718233] [2022-12-13 09:59:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:19,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:19,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126718233] [2022-12-13 09:59:19,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126718233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:19,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:19,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:59:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247912971] [2022-12-13 09:59:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:59:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:59:19,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:59:19,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 09:59:19,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 41 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:19,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:19,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 09:59:19,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:19,146 INFO L130 PetriNetUnfolder]: 24/75 cut-off events. [2022-12-13 09:59:19,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:19,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 75 events. 24/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 287 event pairs, 18 based on Foata normal form. 9/56 useless extension candidates. Maximal degree in co-relation 139. Up to 48 conditions per place. [2022-12-13 09:59:19,147 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 10 selfloop transitions, 4 changer transitions 5/21 dead transitions. [2022-12-13 09:59:19,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 81 flow [2022-12-13 09:59:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:59:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:59:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-13 09:59:19,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-13 09:59:19,157 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 41 flow. Second operand 3 states and 28 transitions. [2022-12-13 09:59:19,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 81 flow [2022-12-13 09:59:19,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:59:19,160 INFO L231 Difference]: Finished difference. Result has 25 places, 14 transitions, 44 flow [2022-12-13 09:59:19,161 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=14} [2022-12-13 09:59:19,163 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2022-12-13 09:59:19,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:19,164 INFO L89 Accepts]: Start accepts. Operand has 25 places, 14 transitions, 44 flow [2022-12-13 09:59:19,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:19,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:19,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 14 transitions, 44 flow [2022-12-13 09:59:19,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 14 transitions, 44 flow [2022-12-13 09:59:19,169 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 09:59:19,169 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:59:19,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 09:59:19,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 14 transitions, 44 flow [2022-12-13 09:59:19,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 09:59:19,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [191] L688-->L691: Formula: (and (= v_~g~0_34 2) (= (store |v_#pthreadsMutex_236| |v_~#A~0.base_91| (store (select |v_#pthreadsMutex_236| |v_~#A~0.base_91|) |v_~#A~0.offset_91| 1)) |v_#pthreadsMutex_235|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_236|, ~#A~0.offset=|v_~#A~0.offset_91|, ~#A~0.base=|v_~#A~0.base_91|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_235|, ~#A~0.offset=|v_~#A~0.offset_91|, ~g~0=v_~g~0_34, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_31|, ~#A~0.base=|v_~#A~0.base_91|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [182] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_215| |v_~#B~0.base_67|))) (let ((.cse0 (store |v_#pthreadsMutex_215| |v_~#B~0.base_67| (store .cse2 |v_~#B~0.offset_67| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_75|))) (and (= v_~g~0_23 1) (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27) (= (store .cse0 |v_~#A~0.base_75| (store .cse1 |v_~#A~0.offset_75| 1)) |v_#pthreadsMutex_213|) (= (select .cse2 |v_~#B~0.offset_67|) 0) (= (select .cse1 |v_~#A~0.offset_75|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_215|, ~#B~0.base=|v_~#B~0.base_67|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_75|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, ~#A~0.base=|v_~#A~0.base_75|, ~#B~0.offset=|v_~#B~0.offset_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, ~#B~0.base=|v_~#B~0.base_67|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_75|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_31|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_27|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27, ~#A~0.base=|v_~#A~0.base_75|, ~#B~0.offset=|v_~#B~0.offset_67|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 09:59:19,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [200] L688-->L692: Formula: (and (= |v_#pthreadsMutex_295| (store |v_#pthreadsMutex_297| |v_~#A~0.base_121| (store (select |v_#pthreadsMutex_297| |v_~#A~0.base_121|) |v_~#A~0.offset_121| 0))) (= v_~g~0_58 2)) InVars {#pthreadsMutex=|v_#pthreadsMutex_297|, ~#A~0.offset=|v_~#A~0.offset_121|, ~#A~0.base=|v_~#A~0.base_121|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_295|, ~#A~0.offset=|v_~#A~0.offset_121|, ~g~0=v_~g~0_58, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_45|, ~#A~0.base=|v_~#A~0.base_121|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_#t~nondet3] and [182] $Ultimate##0-->L688: Formula: (let ((.cse2 (select |v_#pthreadsMutex_215| |v_~#B~0.base_67|))) (let ((.cse0 (store |v_#pthreadsMutex_215| |v_~#B~0.base_67| (store .cse2 |v_~#B~0.offset_67| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_75|))) (and (= v_~g~0_23 1) (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27) (= (store .cse0 |v_~#A~0.base_75| (store .cse1 |v_~#A~0.offset_75| 1)) |v_#pthreadsMutex_213|) (= (select .cse2 |v_~#B~0.offset_67|) 0) (= (select .cse1 |v_~#A~0.offset_75|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_215|, ~#B~0.base=|v_~#B~0.base_67|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_75|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, ~#A~0.base=|v_~#A~0.base_75|, ~#B~0.offset=|v_~#B~0.offset_67|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, ~#B~0.base=|v_~#B~0.base_67|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_75|, ~g~0=v_~g~0_23, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_31|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_27|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27, ~#A~0.base=|v_~#A~0.base_75|, ~#B~0.offset=|v_~#B~0.offset_67|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] [2022-12-13 09:59:19,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_412| |v_~#A~0.base_154| (store (select |v_#pthreadsMutex_412| |v_~#A~0.base_154|) |v_~#A~0.offset_154| 0)))) (let ((.cse0 (select .cse3 |v_~#B~0.base_122|))) (let ((.cse2 (store .cse3 |v_~#B~0.base_122| (store .cse0 |v_~#B~0.offset_122| 1)))) (let ((.cse1 (select .cse2 |v_~#A~0.base_154|))) (and (= |v_t_funThread1of1ForFork0_#in~arg.offset_44| v_t_funThread1of1ForFork0_~arg.offset_45) (= v_t_funThread1of1ForFork0_~arg.base_45 |v_t_funThread1of1ForFork0_#in~arg.base_44|) (= (select .cse0 |v_~#B~0.offset_122|) 0) (= (select .cse1 |v_~#A~0.offset_154|) 0) (= v_~g~0_89 1) (= (store .cse2 |v_~#A~0.base_154| (store .cse1 |v_~#A~0.offset_154| 1)) |v_#pthreadsMutex_410|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_412|, ~#B~0.base=|v_~#B~0.base_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, ~#A~0.base=|v_~#A~0.base_154|, ~#B~0.offset=|v_~#B~0.offset_122|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_410|, ~#B~0.base=|v_~#B~0.base_122|, ~g~0=v_~g~0_89, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_45, ~#B~0.offset=|v_~#B~0.offset_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_45, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_49|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_41|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_67|, ~#A~0.base=|v_~#A~0.base_154|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [146] L692-->L693: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#B~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#B~0.base_9|) |v_~#B~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 09:59:19,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_412| |v_~#A~0.base_154| (store (select |v_#pthreadsMutex_412| |v_~#A~0.base_154|) |v_~#A~0.offset_154| 0)))) (let ((.cse0 (select .cse3 |v_~#B~0.base_122|))) (let ((.cse2 (store .cse3 |v_~#B~0.base_122| (store .cse0 |v_~#B~0.offset_122| 1)))) (let ((.cse1 (select .cse2 |v_~#A~0.base_154|))) (and (= |v_t_funThread1of1ForFork0_#in~arg.offset_44| v_t_funThread1of1ForFork0_~arg.offset_45) (= v_t_funThread1of1ForFork0_~arg.base_45 |v_t_funThread1of1ForFork0_#in~arg.base_44|) (= (select .cse0 |v_~#B~0.offset_122|) 0) (= (select .cse1 |v_~#A~0.offset_154|) 0) (= v_~g~0_89 1) (= (store .cse2 |v_~#A~0.base_154| (store .cse1 |v_~#A~0.offset_154| 1)) |v_#pthreadsMutex_410|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_412|, ~#B~0.base=|v_~#B~0.base_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, ~#A~0.base=|v_~#A~0.base_154|, ~#B~0.offset=|v_~#B~0.offset_122|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_410|, ~#B~0.base=|v_~#B~0.base_122|, ~g~0=v_~g~0_89, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_45, ~#B~0.offset=|v_~#B~0.offset_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_45, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_49|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_41|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_67|, ~#A~0.base=|v_~#A~0.base_154|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [168] L692-->t_funFINAL: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_80| |v_~#B~0.base_33| (store (select |v_#pthreadsMutex_80| |v_~#B~0.base_33|) |v_~#B~0.offset_33| 0)) |v_#pthreadsMutex_79|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_80|, ~#B~0.base=|v_~#B~0.base_33|, ~#B~0.offset=|v_~#B~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_79|, ~#B~0.base=|v_~#B~0.base_33|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#B~0.offset=|v_~#B~0.offset_33|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:19,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [203] L688-->L688: Formula: (let ((.cse3 (store |v_#pthreadsMutex_412| |v_~#A~0.base_154| (store (select |v_#pthreadsMutex_412| |v_~#A~0.base_154|) |v_~#A~0.offset_154| 0)))) (let ((.cse0 (select .cse3 |v_~#B~0.base_122|))) (let ((.cse2 (store .cse3 |v_~#B~0.base_122| (store .cse0 |v_~#B~0.offset_122| 1)))) (let ((.cse1 (select .cse2 |v_~#A~0.base_154|))) (and (= |v_t_funThread1of1ForFork0_#in~arg.offset_44| v_t_funThread1of1ForFork0_~arg.offset_45) (= v_t_funThread1of1ForFork0_~arg.base_45 |v_t_funThread1of1ForFork0_#in~arg.base_44|) (= (select .cse0 |v_~#B~0.offset_122|) 0) (= (select .cse1 |v_~#A~0.offset_154|) 0) (= v_~g~0_89 1) (= (store .cse2 |v_~#A~0.base_154| (store .cse1 |v_~#A~0.offset_154| 1)) |v_#pthreadsMutex_410|)))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_412|, ~#B~0.base=|v_~#B~0.base_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, ~#A~0.base=|v_~#A~0.base_154|, ~#B~0.offset=|v_~#B~0.offset_122|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_410|, ~#B~0.base=|v_~#B~0.base_122|, ~g~0=v_~g~0_89, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_44|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_45, ~#B~0.offset=|v_~#B~0.offset_122|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_44|, ~#A~0.offset=|v_~#A~0.offset_154|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_45, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_49|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_41|, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_67|, ~#A~0.base=|v_~#A~0.base_154|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3] and [169] L692-->t_funEXIT: Formula: (and (= |v_#pthreadsMutex_83| (store |v_#pthreadsMutex_84| |v_~#B~0.base_35| (store (select |v_#pthreadsMutex_84| |v_~#B~0.base_35|) |v_~#B~0.offset_35| 0))) (= |v_t_funThread1of1ForFork0_#res.offset_9| 0) (= |v_t_funThread1of1ForFork0_#res.base_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_84|, ~#B~0.base=|v_~#B~0.base_35|, ~#B~0.offset=|v_~#B~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_83|, ~#B~0.base=|v_~#B~0.base_35|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_9|, ~#B~0.offset=|v_~#B~0.offset_35|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:19,449 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:59:19,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 09:59:19,450 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 13 transitions, 60 flow [2022-12-13 09:59:19,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:19,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:19,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:59:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:59:19,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1803818608, now seen corresponding path program 1 times [2022-12-13 09:59:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807823508] [2022-12-13 09:59:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:19,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807823508] [2022-12-13 09:59:19,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807823508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:19,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:19,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:59:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804652651] [2022-12-13 09:59:19,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:19,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:59:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:59:19,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:59:19,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-13 09:59:19,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:19,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:19,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-13 09:59:19,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:19,526 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 09:59:19,526 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 09:59:19,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 18 events. 4/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 39 event pairs, 1 based on Foata normal form. 4/18 useless extension candidates. Maximal degree in co-relation 37. Up to 12 conditions per place. [2022-12-13 09:59:19,527 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 5 selfloop transitions, 3 changer transitions 2/10 dead transitions. [2022-12-13 09:59:19,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 50 flow [2022-12-13 09:59:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:59:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:59:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-12-13 09:59:19,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-13 09:59:19,528 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 60 flow. Second operand 3 states and 12 transitions. [2022-12-13 09:59:19,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 50 flow [2022-12-13 09:59:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 10 transitions, 46 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:59:19,528 INFO L231 Difference]: Finished difference. Result has 15 places, 7 transitions, 26 flow [2022-12-13 09:59:19,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=15, PETRI_TRANSITIONS=7} [2022-12-13 09:59:19,529 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, -8 predicate places. [2022-12-13 09:59:19,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:19,529 INFO L89 Accepts]: Start accepts. Operand has 15 places, 7 transitions, 26 flow [2022-12-13 09:59:19,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:19,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:19,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 7 transitions, 26 flow [2022-12-13 09:59:19,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 7 transitions, 26 flow [2022-12-13 09:59:19,532 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 09:59:19,532 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:19,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 8 events. 0/8 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 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-13 09:59:19,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 13 places, 7 transitions, 26 flow [2022-12-13 09:59:19,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 09:59:19,641 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:59:19,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 09:59:19,642 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 4 transitions, 18 flow [2022-12-13 09:59:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:19,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:19,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 09:59:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:59:19,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 7062288, now seen corresponding path program 1 times [2022-12-13 09:59:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607366453] [2022-12-13 09:59:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607366453] [2022-12-13 09:59:19,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607366453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:19,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:19,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:59:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458322323] [2022-12-13 09:59:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:19,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:59:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:59:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:59:19,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-13 09:59:19,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 10 places, 4 transitions, 18 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-13 09:59:19,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:19,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-13 09:59:19,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:19,752 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:59:19,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:19,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14 conditions, 3 events. 0/3 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/4 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:59:19,753 INFO L137 encePairwiseOnDemand]: 1/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-13 09:59:19,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 3 transitions, 18 flow [2022-12-13 09:59:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:59:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:59:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2022-12-13 09:59:19,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 09:59:19,754 INFO L175 Difference]: Start difference. First operand has 10 places, 4 transitions, 18 flow. Second operand 4 states and 4 transitions. [2022-12-13 09:59:19,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 3 transitions, 18 flow [2022-12-13 09:59:19,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 3 transitions, 14 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:59:19,754 INFO L231 Difference]: Finished difference. Result has 9 places, 0 transitions, 0 flow [2022-12-13 09:59:19,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=4, PETRI_DIFFERENCE_MINUEND_FLOW=8, PETRI_DIFFERENCE_MINUEND_PLACES=6, 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=9, PETRI_TRANSITIONS=0} [2022-12-13 09:59:19,755 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, -14 predicate places. [2022-12-13 09:59:19,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:19,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 0 transitions, 0 flow [2022-12-13 09:59:19,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:59:19,755 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:59:19,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:19,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:59:19,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:59:19,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:59:19,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:59:19,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 09:59:19,757 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:59:19,757 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-13 09:59:19,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 09:59:19,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 09:59:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:59:19,759 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-13 09:59:19,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:59:19,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:59:19,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:59:19 BasicIcfg [2022-12-13 09:59:19,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:59:19,764 INFO L158 Benchmark]: Toolchain (without parser) took 4036.77ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 146.9MB in the beginning and 105.3MB in the end (delta: 41.7MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,764 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 172.0MB. Free memory was 148.5MB in the beginning and 148.4MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:59:19,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.42ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 127.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.28ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,765 INFO L158 Benchmark]: Boogie Preprocessor took 26.14ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,766 INFO L158 Benchmark]: RCFGBuilder took 329.08ms. Allocated memory is still 172.0MB. Free memory was 124.2MB in the beginning and 111.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,766 INFO L158 Benchmark]: TraceAbstraction took 3222.72ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 110.0MB in the beginning and 105.3MB in the end (delta: 4.8MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2022-12-13 09:59:19,767 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.76ms. Allocated memory is still 172.0MB. Free memory was 148.5MB in the beginning and 148.4MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 409.42ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 127.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.28ms. Allocated memory is still 172.0MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.14ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 124.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 329.08ms. Allocated memory is still 172.0MB. Free memory was 124.2MB in the beginning and 111.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3222.72ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 110.0MB in the beginning and 105.3MB in the end (delta: 4.8MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 58 PlacesBefore, 23 PlacesAfterwards, 54 TransitionsBefore, 19 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 46 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 323, independent: 282, independent conditional: 282, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 245, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 245, independent: 199, independent conditional: 0, independent unconditional: 199, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 323, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 245, unknown conditional: 245, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 224, Positive conditional cache size: 224, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 20 PlacesBefore, 19 PlacesAfterwards, 14 TransitionsBefore, 13 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 31, independent conditional: 4, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 13 PlacesBefore, 10 PlacesAfterwards, 7 TransitionsBefore, 4 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 12, Positive conditional cache size: 12, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 20, Positive cache size: 12, Positive conditional cache size: 12, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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, 81 locations, 2 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: 3.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, InterpolantAutomatonStates: 10, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:59:19,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...