/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:43:18,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:43:18,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:43:18,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:43:18,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:43:18,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:43:18,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:43:18,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:43:18,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:43:18,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:43:18,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:43:18,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:43:18,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:43:18,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:43:18,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:43:18,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:43:18,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:43:18,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:43:18,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:43:18,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:43:18,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:43:18,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:43:18,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:43:18,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:43:18,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:43:18,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:43:18,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:43:18,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:43:18,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:43:18,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:43:18,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:43:18,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:43:18,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:43:18,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:43:18,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:43:18,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:43:18,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:43:18,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:43:18,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:43:18,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:43:18,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:43:18,680 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:43:18,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:43:18,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:43:18,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:43:18,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:43:18,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:43:18,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:43:18,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:43:18,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:18,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:43:18,698 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:43:18,698 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 11:43:18,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:43:19,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:43:19,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:43:19,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:43:19,002 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:43:19,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2022-12-13 11:43:19,901 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:43:20,129 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:43:20,129 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i [2022-12-13 11:43:20,142 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7718ea9/5a3f9c51d9114d0aad832260bb78efb3/FLAG0548a1019 [2022-12-13 11:43:20,153 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7718ea9/5a3f9c51d9114d0aad832260bb78efb3 [2022-12-13 11:43:20,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:43:20,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:43:20,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:20,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:43:20,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:43:20,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173b1623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20, skipping insertion in model container [2022-12-13 11:43:20,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:43:20,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:43:20,388 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30247,30260] [2022-12-13 11:43:20,396 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30452,30465] [2022-12-13 11:43:20,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:20,409 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:43:20,441 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30247,30260] [2022-12-13 11:43:20,442 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/time_var_mutex.i[30452,30465] [2022-12-13 11:43:20,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:20,491 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:43:20,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20 WrapperNode [2022-12-13 11:43:20,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:20,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:20,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:43:20,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:43:20,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,542 INFO L138 Inliner]: procedures = 169, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-12-13 11:43:20,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:20,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:43:20,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:43:20,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:43:20,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,571 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:43:20,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:43:20,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:43:20,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:43:20,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (1/1) ... [2022-12-13 11:43:20,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:43:20,599 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 11:43:20,618 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 11:43:20,634 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2022-12-13 11:43:20,635 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2022-12-13 11:43:20,635 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:43:20,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:43:20,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:43:20,636 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 11:43:20,771 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:43:20,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:43:20,925 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:43:20,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:43:20,930 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:43:20,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:20 BoogieIcfgContainer [2022-12-13 11:43:20,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:43:20,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:43:20,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:43:20,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:43:20,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:43:20" (1/3) ... [2022-12-13 11:43:20,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484fd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:20, skipping insertion in model container [2022-12-13 11:43:20,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:20" (2/3) ... [2022-12-13 11:43:20,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484fd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:20, skipping insertion in model container [2022-12-13 11:43:20,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:20" (3/3) ... [2022-12-13 11:43:20,938 INFO L112 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2022-12-13 11:43:20,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:43:20,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:43:20,952 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:43:20,998 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:43:21,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 96 transitions, 208 flow [2022-12-13 11:43:21,059 INFO L130 PetriNetUnfolder]: 5/94 cut-off events. [2022-12-13 11:43:21,059 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:43:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 5/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2022-12-13 11:43:21,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 96 transitions, 208 flow [2022-12-13 11:43:21,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 85 transitions, 179 flow [2022-12-13 11:43:21,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:21,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 85 transitions, 179 flow [2022-12-13 11:43:21,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 85 transitions, 179 flow [2022-12-13 11:43:21,101 INFO L130 PetriNetUnfolder]: 5/85 cut-off events. [2022-12-13 11:43:21,102 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:43:21,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 85 events. 5/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 95 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2022-12-13 11:43:21,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 85 transitions, 179 flow [2022-12-13 11:43:21,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 1042 [2022-12-13 11:43:24,786 INFO L241 LiptonReduction]: Total number of compositions: 67 [2022-12-13 11:43:24,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:43:24,804 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;@129c686b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:43:24,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:43:24,808 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-13 11:43:24,809 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:24,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:24,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:43:24,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 346632985, now seen corresponding path program 1 times [2022-12-13 11:43:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:24,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934693181] [2022-12-13 11:43:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:24,967 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 11:43:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:24,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934693181] [2022-12-13 11:43:24,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934693181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:24,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:43:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813996903] [2022-12-13 11:43:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:24,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:24,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:24,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2022-12-13 11:43:24,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 11:43:24,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:24,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2022-12-13 11:43:24,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:25,137 INFO L130 PetriNetUnfolder]: 483/1030 cut-off events. [2022-12-13 11:43:25,137 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 11:43:25,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 1030 events. 483/1030 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6117 event pairs, 266 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 1795. Up to 491 conditions per place. [2022-12-13 11:43:25,143 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 42 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-12-13 11:43:25,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 214 flow [2022-12-13 11:43:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-13 11:43:25,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2022-12-13 11:43:25,152 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 103 flow. Second operand 3 states and 89 transitions. [2022-12-13 11:43:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 214 flow [2022-12-13 11:43:25,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:43:25,156 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 92 flow [2022-12-13 11:43:25,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 11:43:25,160 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-13 11:43:25,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:25,161 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 92 flow [2022-12-13 11:43:25,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:25,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:25,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 92 flow [2022-12-13 11:43:25,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 92 flow [2022-12-13 11:43:25,166 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-13 11:43:25,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:25,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 42 events. 1/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 119 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2022-12-13 11:43:25,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 92 flow [2022-12-13 11:43:25,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-13 11:43:25,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:43:25,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 11:43:25,276 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 90 flow [2022-12-13 11:43:25,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 11:43:25,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:25,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:43:25,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1900548389, now seen corresponding path program 1 times [2022-12-13 11:43:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247473092] [2022-12-13 11:43:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:25,322 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 11:43:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247473092] [2022-12-13 11:43:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247473092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:25,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:25,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:43:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978150920] [2022-12-13 11:43:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:25,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:25,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2022-12-13 11:43:25,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 11:43:25,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:25,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2022-12-13 11:43:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:25,431 INFO L130 PetriNetUnfolder]: 734/1353 cut-off events. [2022-12-13 11:43:25,431 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 11:43:25,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1353 events. 734/1353 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7371 event pairs, 384 based on Foata normal form. 44/781 useless extension candidates. Maximal degree in co-relation 1974. Up to 749 conditions per place. [2022-12-13 11:43:25,435 INFO L137 encePairwiseOnDemand]: 34/41 looper letters, 42 selfloop transitions, 5 changer transitions 8/62 dead transitions. [2022-12-13 11:43:25,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 245 flow [2022-12-13 11:43:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 11:43:25,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2022-12-13 11:43:25,437 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 90 flow. Second operand 3 states and 78 transitions. [2022-12-13 11:43:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 245 flow [2022-12-13 11:43:25,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:25,439 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 112 flow [2022-12-13 11:43:25,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 11:43:25,439 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-12-13 11:43:25,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:25,440 INFO L89 Accepts]: Start accepts. Operand has 48 places, 40 transitions, 112 flow [2022-12-13 11:43:25,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:25,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:25,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 112 flow [2022-12-13 11:43:25,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 112 flow [2022-12-13 11:43:25,444 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-13 11:43:25,444 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:43:25,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 68 events. 1/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 302 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 86. Up to 11 conditions per place. [2022-12-13 11:43:25,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 112 flow [2022-12-13 11:43:25,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 11:43:25,446 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:25,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 11:43:25,447 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 112 flow [2022-12-13 11:43:25,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 11:43:25,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:25,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:25,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:43:25,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1298156403, now seen corresponding path program 1 times [2022-12-13 11:43:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364688366] [2022-12-13 11:43:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:25,522 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 11:43:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364688366] [2022-12-13 11:43:25,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364688366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:25,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:25,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:43:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330825467] [2022-12-13 11:43:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:25,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:25,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:25,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2022-12-13 11:43:25,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:25,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:25,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2022-12-13 11:43:25,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:25,622 INFO L130 PetriNetUnfolder]: 489/932 cut-off events. [2022-12-13 11:43:25,622 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-13 11:43:25,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 932 events. 489/932 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4818 event pairs, 258 based on Foata normal form. 35/598 useless extension candidates. Maximal degree in co-relation 1697. Up to 516 conditions per place. [2022-12-13 11:43:25,625 INFO L137 encePairwiseOnDemand]: 32/38 looper letters, 25 selfloop transitions, 4 changer transitions 22/57 dead transitions. [2022-12-13 11:43:25,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 249 flow [2022-12-13 11:43:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 11:43:25,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2022-12-13 11:43:25,626 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 112 flow. Second operand 3 states and 73 transitions. [2022-12-13 11:43:25,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 249 flow [2022-12-13 11:43:25,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:25,628 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 92 flow [2022-12-13 11:43:25,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-13 11:43:25,629 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-13 11:43:25,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:25,629 INFO L89 Accepts]: Start accepts. Operand has 46 places, 30 transitions, 92 flow [2022-12-13 11:43:25,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:25,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:25,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 92 flow [2022-12-13 11:43:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 92 flow [2022-12-13 11:43:25,633 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 11:43:25,633 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 11:43:25,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 44 events. 0/44 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 154 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-13 11:43:25,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 92 flow [2022-12-13 11:43:25,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 11:43:26,052 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:43:26,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-13 11:43:26,053 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 92 flow [2022-12-13 11:43:26,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:26,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:26,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:26,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:43:26,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:26,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1212544953, now seen corresponding path program 1 times [2022-12-13 11:43:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:26,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84622269] [2022-12-13 11:43:26,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:26,189 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 11:43:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:26,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84622269] [2022-12-13 11:43:26,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84622269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:26,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:26,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517008809] [2022-12-13 11:43:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:26,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:26,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:26,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-13 11:43:26,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 11:43:26,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:26,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-13 11:43:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:26,264 INFO L130 PetriNetUnfolder]: 116/249 cut-off events. [2022-12-13 11:43:26,269 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 11:43:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 249 events. 116/249 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1207 event pairs, 34 based on Foata normal form. 12/160 useless extension candidates. Maximal degree in co-relation 613. Up to 120 conditions per place. [2022-12-13 11:43:26,270 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 15 selfloop transitions, 7 changer transitions 22/46 dead transitions. [2022-12-13 11:43:26,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 223 flow [2022-12-13 11:43:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:43:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:43:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 11:43:26,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 11:43:26,273 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 92 flow. Second operand 6 states and 69 transitions. [2022-12-13 11:43:26,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 223 flow [2022-12-13 11:43:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:26,275 INFO L231 Difference]: Finished difference. Result has 36 places, 15 transitions, 65 flow [2022-12-13 11:43:26,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=36, PETRI_TRANSITIONS=15} [2022-12-13 11:43:26,277 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-13 11:43:26,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:26,277 INFO L89 Accepts]: Start accepts. Operand has 36 places, 15 transitions, 65 flow [2022-12-13 11:43:26,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:26,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:26,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 15 transitions, 65 flow [2022-12-13 11:43:26,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 15 transitions, 65 flow [2022-12-13 11:43:26,280 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 11:43:26,280 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:43:26,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 18 events. 0/18 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 11:43:26,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 15 transitions, 65 flow [2022-12-13 11:43:26,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 11:43:26,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] $Ultimate##0-->L713: Formula: (let ((.cse0 (select |v_#pthreadsMutex_731| |v_~#m_busy~0.base_278|))) (and (= v_~block~0_237 0) (= v_de_allocatorThread1of1ForFork0_~_.base_119 |v_de_allocatorThread1of1ForFork0_#in~_.base_105|) (= (select .cse0 |v_~#m_busy~0.offset_278|) 0) (= |v_#pthreadsMutex_729| (store |v_#pthreadsMutex_731| |v_~#m_busy~0.base_278| (store .cse0 |v_~#m_busy~0.offset_278| 0))) (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_105| v_de_allocatorThread1of1ForFork0_~_.offset_119) (= v_~busy~0_126 0))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_105|, #pthreadsMutex=|v_#pthreadsMutex_731|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_278|, ~#m_busy~0.base=|v_~#m_busy~0.base_278|, ~busy~0=v_~busy~0_126, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_105|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_105|, #pthreadsMutex=|v_#pthreadsMutex_729|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_278|, ~block~0=v_~block~0_237, ~#m_busy~0.base=|v_~#m_busy~0.base_278|, ~busy~0=v_~busy~0_126, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_119, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_157|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_105|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_119} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_~_.offset] and [348] $Ultimate##0-->L702: Formula: (let ((.cse1 (select |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158|))) (let ((.cse2 (store |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158| (store .cse1 |v_~#m_inode~0.offset_158| 1)))) (let ((.cse0 (select .cse2 |v_~#m_busy~0.base_266|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= (select .cse0 |v_~#m_busy~0.offset_266|) 0) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= v_~inode~0_124 1) (= v_~busy~0_111 1) (= (select .cse1 |v_~#m_inode~0.offset_158|) 0) (= (store .cse2 |v_~#m_busy~0.base_266| (store .cse0 |v_~#m_busy~0.offset_266| 0)) |v_#pthreadsMutex_699|) (= v_~inode~0_125 0) (= v_~block~0_227 1))))) InVars {~inode~0=v_~inode~0_125, #pthreadsMutex=|v_#pthreadsMutex_700|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_699|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, ~inode~0=v_~inode~0_124, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_227, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_105|, ~busy~0=v_~busy~0_111, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_87|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] [2022-12-13 11:43:26,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] $Ultimate##0-->de_allocatorFINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_737| |v_~#m_busy~0.base_280|))) (and (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_107| v_de_allocatorThread1of1ForFork0_~_.offset_121) (= v_de_allocatorThread1of1ForFork0_~_.base_121 |v_de_allocatorThread1of1ForFork0_#in~_.base_107|) (= |v_de_allocatorThread1of1ForFork0_#res.offset_57| 0) (= (store |v_#pthreadsMutex_737| |v_~#m_busy~0.base_280| (store .cse0 |v_~#m_busy~0.offset_280| 0)) |v_#pthreadsMutex_735|) (= v_~block~0_239 0) (= |v_de_allocatorThread1of1ForFork0_#res.base_57| 0) (= v_~busy~0_128 0) (= 0 (select .cse0 |v_~#m_busy~0.offset_280|)))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_107|, #pthreadsMutex=|v_#pthreadsMutex_737|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_280|, ~#m_busy~0.base=|v_~#m_busy~0.base_280|, ~busy~0=v_~busy~0_128, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_107|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_107|, #pthreadsMutex=|v_#pthreadsMutex_735|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_280|, ~block~0=v_~block~0_239, ~#m_busy~0.base=|v_~#m_busy~0.base_280|, ~busy~0=v_~busy~0_128, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_121, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_159|, de_allocatorThread1of1ForFork0_#res.base=|v_de_allocatorThread1of1ForFork0_#res.base_57|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_107|, de_allocatorThread1of1ForFork0_#res.offset=|v_de_allocatorThread1of1ForFork0_#res.offset_57|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_121} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_#res.base, de_allocatorThread1of1ForFork0_#res.offset, de_allocatorThread1of1ForFork0_~_.offset] and [348] $Ultimate##0-->L702: Formula: (let ((.cse1 (select |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158|))) (let ((.cse2 (store |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158| (store .cse1 |v_~#m_inode~0.offset_158| 1)))) (let ((.cse0 (select .cse2 |v_~#m_busy~0.base_266|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= (select .cse0 |v_~#m_busy~0.offset_266|) 0) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= v_~inode~0_124 1) (= v_~busy~0_111 1) (= (select .cse1 |v_~#m_inode~0.offset_158|) 0) (= (store .cse2 |v_~#m_busy~0.base_266| (store .cse0 |v_~#m_busy~0.offset_266| 0)) |v_#pthreadsMutex_699|) (= v_~inode~0_125 0) (= v_~block~0_227 1))))) InVars {~inode~0=v_~inode~0_125, #pthreadsMutex=|v_#pthreadsMutex_700|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_699|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, ~inode~0=v_~inode~0_124, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_227, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_105|, ~busy~0=v_~busy~0_111, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_87|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] [2022-12-13 11:43:26,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] $Ultimate##0-->de_allocatorEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_743| |v_~#m_busy~0.base_282|))) (and (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_109| v_de_allocatorThread1of1ForFork0_~_.offset_123) (= |v_de_allocatorThread1of1ForFork0_#res.base_59| 0) (= |v_de_allocatorThread1of1ForFork0_#res.offset_59| 0) (= |v_#pthreadsMutex_741| (store |v_#pthreadsMutex_743| |v_~#m_busy~0.base_282| (store .cse0 |v_~#m_busy~0.offset_282| 0))) (= v_de_allocatorThread1of1ForFork0_~_.base_123 |v_de_allocatorThread1of1ForFork0_#in~_.base_109|) (= v_~block~0_241 0) (= (select .cse0 |v_~#m_busy~0.offset_282|) 0) (= v_~busy~0_130 0))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_109|, #pthreadsMutex=|v_#pthreadsMutex_743|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_282|, ~#m_busy~0.base=|v_~#m_busy~0.base_282|, ~busy~0=v_~busy~0_130, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_109|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_109|, #pthreadsMutex=|v_#pthreadsMutex_741|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_282|, ~block~0=v_~block~0_241, ~#m_busy~0.base=|v_~#m_busy~0.base_282|, ~busy~0=v_~busy~0_130, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_123, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_161|, de_allocatorThread1of1ForFork0_#res.base=|v_de_allocatorThread1of1ForFork0_#res.base_59|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_109|, de_allocatorThread1of1ForFork0_#res.offset=|v_de_allocatorThread1of1ForFork0_#res.offset_59|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_123} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_#res.base, de_allocatorThread1of1ForFork0_#res.offset, de_allocatorThread1of1ForFork0_~_.offset] and [348] $Ultimate##0-->L702: Formula: (let ((.cse1 (select |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158|))) (let ((.cse2 (store |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158| (store .cse1 |v_~#m_inode~0.offset_158| 1)))) (let ((.cse0 (select .cse2 |v_~#m_busy~0.base_266|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= (select .cse0 |v_~#m_busy~0.offset_266|) 0) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= v_~inode~0_124 1) (= v_~busy~0_111 1) (= (select .cse1 |v_~#m_inode~0.offset_158|) 0) (= (store .cse2 |v_~#m_busy~0.base_266| (store .cse0 |v_~#m_busy~0.offset_266| 0)) |v_#pthreadsMutex_699|) (= v_~inode~0_125 0) (= v_~block~0_227 1))))) InVars {~inode~0=v_~inode~0_125, #pthreadsMutex=|v_#pthreadsMutex_700|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_699|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, ~inode~0=v_~inode~0_124, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_227, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_105|, ~busy~0=v_~busy~0_111, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_87|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] [2022-12-13 11:43:26,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L710: Formula: (let ((.cse0 (select |v_#pthreadsMutex_726| |v_~#m_busy~0.base_276|))) (and (= v_de_allocatorThread1of1ForFork0_~_.base_117 |v_de_allocatorThread1of1ForFork0_#in~_.base_103|) (= v_~busy~0_124 0) (= |v_de_allocatorThread1of1ForFork0_#in~_.offset_103| v_de_allocatorThread1of1ForFork0_~_.offset_117) (= (select .cse0 |v_~#m_busy~0.offset_276|) 0) (= v_~block~0_235 0) (= (store |v_#pthreadsMutex_726| |v_~#m_busy~0.base_276| (store .cse0 |v_~#m_busy~0.offset_276| 1)) |v_#pthreadsMutex_725|))) InVars {de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_103|, #pthreadsMutex=|v_#pthreadsMutex_726|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_276|, ~busy~0=v_~busy~0_124, ~#m_busy~0.base=|v_~#m_busy~0.base_276|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_103|} OutVars{de_allocatorThread1of1ForFork0_#in~_.offset=|v_de_allocatorThread1of1ForFork0_#in~_.offset_103|, #pthreadsMutex=|v_#pthreadsMutex_725|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_276|, ~block~0=v_~block~0_235, ~busy~0=v_~busy~0_124, ~#m_busy~0.base=|v_~#m_busy~0.base_276|, de_allocatorThread1of1ForFork0_~_.base=v_de_allocatorThread1of1ForFork0_~_.base_117, de_allocatorThread1of1ForFork0_#t~nondet5=|v_de_allocatorThread1of1ForFork0_#t~nondet5_155|, de_allocatorThread1of1ForFork0_#in~_.base=|v_de_allocatorThread1of1ForFork0_#in~_.base_103|, de_allocatorThread1of1ForFork0_~_.offset=v_de_allocatorThread1of1ForFork0_~_.offset_117} AuxVars[] AssignedVars[#pthreadsMutex, ~block~0, de_allocatorThread1of1ForFork0_~_.base, de_allocatorThread1of1ForFork0_#t~nondet5, de_allocatorThread1of1ForFork0_~_.offset] and [348] $Ultimate##0-->L702: Formula: (let ((.cse1 (select |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158|))) (let ((.cse2 (store |v_#pthreadsMutex_700| |v_~#m_inode~0.base_158| (store .cse1 |v_~#m_inode~0.offset_158| 1)))) (let ((.cse0 (select .cse2 |v_~#m_busy~0.base_266|))) (and (= |v_allocatorThread1of1ForFork1_#in~_.offset_45| v_allocatorThread1of1ForFork1_~_.offset_45) (= (select .cse0 |v_~#m_busy~0.offset_266|) 0) (= |v_allocatorThread1of1ForFork1_#in~_.base_45| v_allocatorThread1of1ForFork1_~_.base_45) (= v_~inode~0_124 1) (= v_~busy~0_111 1) (= (select .cse1 |v_~#m_inode~0.offset_158|) 0) (= (store .cse2 |v_~#m_busy~0.base_266| (store .cse0 |v_~#m_busy~0.offset_266| 0)) |v_#pthreadsMutex_699|) (= v_~inode~0_125 0) (= v_~block~0_227 1))))) InVars {~inode~0=v_~inode~0_125, #pthreadsMutex=|v_#pthreadsMutex_700|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_699|, ~#m_busy~0.offset=|v_~#m_busy~0.offset_266|, ~#m_busy~0.base=|v_~#m_busy~0.base_266|, allocatorThread1of1ForFork1_~_.base=v_allocatorThread1of1ForFork1_~_.base_45, ~#m_inode~0.offset=|v_~#m_inode~0.offset_158|, ~#m_inode~0.base=|v_~#m_inode~0.base_158|, ~inode~0=v_~inode~0_124, allocatorThread1of1ForFork1_#in~_.base=|v_allocatorThread1of1ForFork1_#in~_.base_45|, ~block~0=v_~block~0_227, allocatorThread1of1ForFork1_#t~nondet3=|v_allocatorThread1of1ForFork1_#t~nondet3_105|, ~busy~0=v_~busy~0_111, allocatorThread1of1ForFork1_#t~nondet4=|v_allocatorThread1of1ForFork1_#t~nondet4_87|, allocatorThread1of1ForFork1_~_.offset=v_allocatorThread1of1ForFork1_~_.offset_45, allocatorThread1of1ForFork1_#in~_.offset=|v_allocatorThread1of1ForFork1_#in~_.offset_45|} AuxVars[] AssignedVars[~inode~0, #pthreadsMutex, ~block~0, allocatorThread1of1ForFork1_#t~nondet3, allocatorThread1of1ForFork1_~_.base, ~busy~0, allocatorThread1of1ForFork1_#t~nondet4, allocatorThread1of1ForFork1_~_.offset] [2022-12-13 11:43:26,829 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:43:26,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-13 11:43:26,830 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 95 flow [2022-12-13 11:43:26,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 11:43:26,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:26,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:26,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:43:26,830 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION === [allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1900526606, now seen corresponding path program 1 times [2022-12-13 11:43:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:26,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564607827] [2022-12-13 11:43:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:26,854 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 11:43:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564607827] [2022-12-13 11:43:26,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564607827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:26,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:26,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85421022] [2022-12-13 11:43:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:26,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 11:43:26,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 95 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-13 11:43:26,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:26,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 11:43:26,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:26,872 INFO L130 PetriNetUnfolder]: 4/17 cut-off events. [2022-12-13 11:43:26,872 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 11:43:26,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 17 events. 4/17 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 33 event pairs, 0 based on Foata normal form. 3/18 useless extension candidates. Maximal degree in co-relation 22. Up to 9 conditions per place. [2022-12-13 11:43:26,873 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 0 selfloop transitions, 0 changer transitions 13/13 dead transitions. [2022-12-13 11:43:26,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 13 transitions, 61 flow [2022-12-13 11:43:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-13 11:43:26,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:43:26,874 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 95 flow. Second operand 3 states and 21 transitions. [2022-12-13 11:43:26,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 13 transitions, 61 flow [2022-12-13 11:43:26,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 13 transitions, 55 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:43:26,875 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2022-12-13 11:43:26,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=17, PETRI_TRANSITIONS=0} [2022-12-13 11:43:26,875 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -34 predicate places. [2022-12-13 11:43:26,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:26,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 0 transitions, 0 flow [2022-12-13 11:43:26,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 11:43:26,876 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 11:43:26,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:26,876 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 11:43:26,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 11:43:26,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 11:43:26,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:26,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 11:43:26,877 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 11:43:26,877 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-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-13 11:43:26,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:43:26,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:43:26,880 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 11:43:26,883 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:43:26,883 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:43:26,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:43:26 BasicIcfg [2022-12-13 11:43:26,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:43:26,885 INFO L158 Benchmark]: Toolchain (without parser) took 6729.80ms. Allocated memory was 219.2MB in the beginning and 304.1MB in the end (delta: 84.9MB). Free memory was 193.6MB in the beginning and 139.7MB in the end (delta: 53.9MB). Peak memory consumption was 138.8MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,885 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:43:26,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.39ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 173.5MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.01ms. Allocated memory is still 219.2MB. Free memory was 173.5MB in the beginning and 171.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,886 INFO L158 Benchmark]: Boogie Preprocessor took 30.49ms. Allocated memory is still 219.2MB. Free memory was 171.6MB in the beginning and 170.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,886 INFO L158 Benchmark]: RCFGBuilder took 358.04ms. Allocated memory is still 219.2MB. Free memory was 170.0MB in the beginning and 155.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,886 INFO L158 Benchmark]: TraceAbstraction took 5951.62ms. Allocated memory was 219.2MB in the beginning and 304.1MB in the end (delta: 84.9MB). Free memory was 154.3MB in the beginning and 139.7MB in the end (delta: 14.6MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2022-12-13 11:43:26,887 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 195.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.39ms. Allocated memory is still 219.2MB. Free memory was 193.1MB in the beginning and 173.5MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.01ms. Allocated memory is still 219.2MB. Free memory was 173.5MB in the beginning and 171.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.49ms. Allocated memory is still 219.2MB. Free memory was 171.6MB in the beginning and 170.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 358.04ms. Allocated memory is still 219.2MB. Free memory was 170.0MB in the beginning and 155.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5951.62ms. Allocated memory was 219.2MB in the beginning and 304.1MB in the end (delta: 84.9MB). Free memory was 154.3MB in the beginning and 139.7MB in the end (delta: 14.6MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 87 PlacesBefore, 51 PlacesAfterwards, 85 TransitionsBefore, 47 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 21 ConcurrentYvCompositions, 2 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1795, independent: 1704, independent conditional: 1704, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1795, independent: 1704, independent conditional: 0, independent unconditional: 1704, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1795, independent: 1704, independent conditional: 0, independent unconditional: 1704, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1795, independent: 1704, independent conditional: 0, independent unconditional: 1704, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 883, independent: 854, independent conditional: 0, independent unconditional: 854, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 883, independent: 805, independent conditional: 0, independent unconditional: 805, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1795, independent: 850, independent conditional: 0, independent unconditional: 850, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 883, unknown conditional: 0, unknown unconditional: 883] , Statistics on independence cache: Total cache size (in pairs): 1557, Positive cache size: 1528, Positive conditional cache size: 0, Positive unconditional cache size: 1528, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 775, independent: 711, independent conditional: 711, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 775, independent: 711, independent conditional: 60, independent unconditional: 651, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 775, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 775, independent: 711, independent conditional: 0, independent unconditional: 711, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 775, independent: 412, independent conditional: 0, independent unconditional: 412, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 321, Positive conditional cache size: 0, Positive unconditional cache size: 321, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 220, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 220, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 220, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 220, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 220, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 329, Positive conditional cache size: 0, Positive unconditional cache size: 329, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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.4s, 38 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 25 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, independent: 257, independent conditional: 257, 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: 278, independent: 257, independent conditional: 32, independent unconditional: 225, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 278, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 278, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 49, independent conditional: 0, independent unconditional: 49, 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: 51, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 278, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 51, unknown conditional: 0, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 466, Positive conditional cache size: 0, Positive unconditional cache size: 466, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 27 PlacesBefore, 26 PlacesAfterwards, 15 TransitionsBefore, 18 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 36, 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: 36, independent: 36, independent conditional: 36, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 36, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 496, Positive conditional cache size: 6, Positive unconditional cache size: 490, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 496, Positive conditional cache size: 6, Positive unconditional cache size: 490, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 702]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 710]: 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 5 procedures, 125 locations, 6 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.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 9 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=2, InterpolantAutomatonStates: 18, 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.3s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 11:43:26,918 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...