/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/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:08:39,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:08:39,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:08:39,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:08:39,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:08:39,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:08:39,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:08:39,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:08:39,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:08:39,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:08:39,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:08:39,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:08:39,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:08:39,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:08:39,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:08:39,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:08:39,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:08:39,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:08:39,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:08:39,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:08:39,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:08:39,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:08:39,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:08:39,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:08:39,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:08:39,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:08:39,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:08:39,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:08:39,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:08:39,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:08:39,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:08:39,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:08:39,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:08:39,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:08:39,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:08:39,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:08:39,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:08:39,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:08:39,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:08:39,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:08:39,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:08:39,510 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-06 07:08:39,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:08:39,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:08:39,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:08:39,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:08:39,540 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:08:39,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:08:39,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:08:39,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:08:39,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:08:39,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:08:39,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:08:39,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:08:39,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:08:39,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:08:39,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:08:39,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:08:39,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:08:39,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:08:39,834 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:08:39,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-06 07:08:40,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:08:41,092 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:08:41,092 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-06 07:08:41,102 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0403bcb0d/5a11981aaf6e40b49f1f5c588452f603/FLAG9ddb11f3e [2022-12-06 07:08:41,113 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0403bcb0d/5a11981aaf6e40b49f1f5c588452f603 [2022-12-06 07:08:41,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:08:41,119 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:08:41,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:08:41,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:08:41,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:08:41,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d30611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41, skipping insertion in model container [2022-12-06 07:08:41,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:08:41,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:08:41,284 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2022-12-06 07:08:41,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:08:41,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:08:41,423 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2022-12-06 07:08:41,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:08:41,483 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:08:41,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41 WrapperNode [2022-12-06 07:08:41,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:08:41,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:08:41,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:08:41,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:08:41,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,529 INFO L138 Inliner]: procedures = 162, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-12-06 07:08:41,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:08:41,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:08:41,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:08:41,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:08:41,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,543 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:08:41,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:08:41,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:08:41,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:08:41,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (1/1) ... [2022-12-06 07:08:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:08:41,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:08:41,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:08:41,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:08:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:08:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 07:08:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:08:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:08:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-06 07:08:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-06 07:08:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:08:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:08:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:08:41,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:08:41,623 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:08:41,700 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:08:41,701 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:08:41,801 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:08:41,805 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:08:41,806 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:08:41,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:08:41 BoogieIcfgContainer [2022-12-06 07:08:41,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:08:41,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:08:41,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:08:41,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:08:41,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:08:41" (1/3) ... [2022-12-06 07:08:41,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29474d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:08:41, skipping insertion in model container [2022-12-06 07:08:41,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:08:41" (2/3) ... [2022-12-06 07:08:41,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29474d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:08:41, skipping insertion in model container [2022-12-06 07:08:41,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:08:41" (3/3) ... [2022-12-06 07:08:41,812 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-06 07:08:41,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:08:41,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:08:41,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:08:41,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 07:08:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 125 flow [2022-12-06 07:08:41,927 INFO L130 PetriNetUnfolder]: 1/59 cut-off events. [2022-12-06 07:08:41,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:41,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-12-06 07:08:41,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 125 flow [2022-12-06 07:08:41,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 51 transitions, 105 flow [2022-12-06 07:08:41,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:08:41,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 105 flow [2022-12-06 07:08:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 105 flow [2022-12-06 07:08:41,990 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-12-06 07:08:41,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:41,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 51 events. 0/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 19 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 07:08:41,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 105 flow [2022-12-06 07:08:41,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 07:08:44,159 INFO L203 LiptonReduction]: Total number of compositions: 42 [2022-12-06 07:08:44,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:08:44,172 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;@1dec2e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:08:44,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-06 07:08:44,174 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 07:08:44,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:44,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:08:44,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 07:08:44,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:08:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:08:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1790175204, now seen corresponding path program 1 times [2022-12-06 07:08:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:08:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503564224] [2022-12-06 07:08:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:08:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:08:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:08:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:08:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:08:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503564224] [2022-12-06 07:08:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503564224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:08:44,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:08:44,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:08:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428640555] [2022-12-06 07:08:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:08:44,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:08:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:08:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:08:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:08:44,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2022-12-06 07:08:44,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 27 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:08:44,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:08:44,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2022-12-06 07:08:44,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:08:44,520 INFO L130 PetriNetUnfolder]: 13/41 cut-off events. [2022-12-06 07:08:44,520 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:44,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 41 events. 13/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 7 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 73. Up to 19 conditions per place. [2022-12-06 07:08:44,522 INFO L137 encePairwiseOnDemand]: 9/12 looper letters, 10 selfloop transitions, 2 changer transitions 2/15 dead transitions. [2022-12-06 07:08:44,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 15 transitions, 59 flow [2022-12-06 07:08:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:08:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:08:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-06 07:08:44,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 07:08:44,530 INFO L175 Difference]: Start difference. First operand has 16 places, 12 transitions, 27 flow. Second operand 3 states and 20 transitions. [2022-12-06 07:08:44,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 15 transitions, 59 flow [2022-12-06 07:08:44,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 15 transitions, 58 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:08:44,533 INFO L231 Difference]: Finished difference. Result has 18 places, 10 transitions, 30 flow [2022-12-06 07:08:44,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=30, PETRI_PLACES=18, PETRI_TRANSITIONS=10} [2022-12-06 07:08:44,536 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, 2 predicate places. [2022-12-06 07:08:44,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:08:44,537 INFO L89 Accepts]: Start accepts. Operand has 18 places, 10 transitions, 30 flow [2022-12-06 07:08:44,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:08:44,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:08:44,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 10 transitions, 30 flow [2022-12-06 07:08:44,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 10 transitions, 30 flow [2022-12-06 07:08:44,543 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-06 07:08:44,543 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:08:44,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 10 events. 0/10 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 07:08:44,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 10 transitions, 30 flow [2022-12-06 07:08:44,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 07:08:44,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:08:44,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:08:44,563 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 30 flow [2022-12-06 07:08:44,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:08:44,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:08:44,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:08:44,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:08:44,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:08:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:08:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2112802295, now seen corresponding path program 1 times [2022-12-06 07:08:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:08:44,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124935110] [2022-12-06 07:08:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:08:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:08:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:08:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:08:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:08:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124935110] [2022-12-06 07:08:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124935110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:08:44,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:08:44,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:08:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545089881] [2022-12-06 07:08:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:08:44,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:08:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:08:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:08:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:08:44,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-06 07:08:44,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 10 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:08:44,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:08:44,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-06 07:08:44,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:08:44,655 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-06 07:08:44,656 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:08:44,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 28 events. 6/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 2 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 59. Up to 18 conditions per place. [2022-12-06 07:08:44,656 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 9 selfloop transitions, 5 changer transitions 0/14 dead transitions. [2022-12-06 07:08:44,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 14 transitions, 68 flow [2022-12-06 07:08:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:08:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:08:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-12-06 07:08:44,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 07:08:44,657 INFO L175 Difference]: Start difference. First operand has 16 places, 10 transitions, 30 flow. Second operand 3 states and 16 transitions. [2022-12-06 07:08:44,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 14 transitions, 68 flow [2022-12-06 07:08:44,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 14 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:08:44,658 INFO L231 Difference]: Finished difference. Result has 17 places, 12 transitions, 49 flow [2022-12-06 07:08:44,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=12} [2022-12-06 07:08:44,659 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, 1 predicate places. [2022-12-06 07:08:44,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:08:44,659 INFO L89 Accepts]: Start accepts. Operand has 17 places, 12 transitions, 49 flow [2022-12-06 07:08:44,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:08:44,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:08:44,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 12 transitions, 49 flow [2022-12-06 07:08:44,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 12 transitions, 49 flow [2022-12-06 07:08:44,663 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 07:08:44,663 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:08:44,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 2 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 07:08:44,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 12 transitions, 49 flow [2022-12-06 07:08:44,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-06 07:08:44,684 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 07:08:44,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [152] L694-3-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_66| |v_~#D~0.base_31|))) (and (= (select .cse0 |v_~#D~0.offset_31|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_14| 0) (= |v_#pthreadsMutex_65| (store |v_#pthreadsMutex_66| |v_~#D~0.base_31| (store .cse0 |v_~#D~0.offset_31| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_66|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_65|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_9|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_14|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~pre3#1] and [164] L689-->t_funEXIT: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_120| |v_~#D~0.base_53| (store (select |v_#pthreadsMutex_120| |v_~#D~0.base_53|) |v_~#D~0.offset_53| 0)) |v_#pthreadsMutex_119|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#D~0.base=|v_~#D~0.base_53|, ~#D~0.offset=|v_~#D~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#D~0.base=|v_~#D~0.base_53|, ~#D~0.offset=|v_~#D~0.offset_53|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-06 07:08:44,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [180] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_342| |v_~#D~0.base_121|))) (let ((.cse0 (store |v_#pthreadsMutex_342| |v_~#D~0.base_121| (store .cse2 |v_~#D~0.offset_121| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_113|))) (and (= v_t_funThread1of1ForFork0_~arg.base_31 |v_t_funThread1of1ForFork0_#in~arg.base_31|) (= v_~g~0_60 17) (= |v_t_funThread1of1ForFork0_#in~arg.offset_31| v_t_funThread1of1ForFork0_~arg.offset_31) (= (store .cse0 |v_~#A~0.base_113| (store .cse1 |v_~#A~0.offset_113| 0)) |v_#pthreadsMutex_340|) (= (select .cse2 |v_~#D~0.offset_121|) 0) (= (select .cse1 |v_~#A~0.offset_113|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_342|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_31|, ~#A~0.offset=|v_~#A~0.offset_113|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_31|, ~#A~0.base=|v_~#A~0.base_113|, ~#D~0.base=|v_~#D~0.base_121|, ~#D~0.offset=|v_~#D~0.offset_121|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_340|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_31|, ~#A~0.offset=|v_~#A~0.offset_113|, ~g~0=v_~g~0_60, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_31, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_73|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_61|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_31|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_31, ~#A~0.base=|v_~#A~0.base_113|, ~#D~0.base=|v_~#D~0.base_121|, ~#D~0.offset=|v_~#D~0.offset_121|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] and [181] L694-3-->t_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_357| |v_~#D~0.base_127|))) (and (= |v_#pthreadsMutex_355| (store |v_#pthreadsMutex_357| |v_~#D~0.base_127| (store .cse0 |v_~#D~0.offset_127| 0))) (= |v_ULTIMATE.start_main_#t~nondet5#1_86| 0) (= (select .cse0 |v_~#D~0.offset_127|) 0) (= |v_t_funThread1of1ForFork0_#res.offset_25| 0) (= |v_t_funThread1of1ForFork0_#res.base_25| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_357|, ~#D~0.base=|v_~#D~0.base_127|, ~#D~0.offset=|v_~#D~0.offset_127|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_355|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_47|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_86|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_25|, ~#D~0.base=|v_~#D~0.base_127|, ~#D~0.offset=|v_~#D~0.offset_127|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_57|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] [2022-12-06 07:08:44,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [185] $Ultimate##0-->t_funEXIT: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_377|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_49|, ~g~0=v_~g~0_64, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_33, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_94|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_33, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_77|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_27|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_63|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_59|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ~g~0, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] and [184] L695-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_374| |v_~#A~0.base_122|))) (and (= (let ((.cse0 (store |v_#pthreadsMutex_374| |v_~#A~0.base_122| (store .cse1 |v_~#A~0.offset_122| 1)))) (store .cse0 |v_~#D~0.base_133| (store (select .cse0 |v_~#D~0.base_133|) |v_~#D~0.offset_133| 0))) |v_#pthreadsMutex_373|) (= (ite (= v_~g~0_62 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25| 0) (= (select .cse1 |v_~#A~0.offset_122|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_374|, ~#A~0.offset=|v_~#A~0.offset_122|, ~g~0=v_~g~0_62, ~#D~0.base=|v_~#D~0.base_133|, ~#A~0.base=|v_~#A~0.base_122|, ~#D~0.offset=|v_~#D~0.offset_133|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_373|, ~#A~0.offset=|v_~#A~0.offset_122|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ~g~0=v_~g~0_62, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_92|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_88|, ~#D~0.base=|v_~#D~0.base_133|, ~#A~0.base=|v_~#A~0.base_122|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|, ~#D~0.offset=|v_~#D~0.offset_133|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-06 07:08:44,871 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:08:44,872 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 07:08:44,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:08:44,872 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:08:44,876 INFO L158 Benchmark]: Toolchain (without parser) took 3756.73ms. Allocated memory was 226.5MB in the beginning and 312.5MB in the end (delta: 86.0MB). Free memory was 200.8MB in the beginning and 225.4MB in the end (delta: -24.5MB). Peak memory consumption was 62.0MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,876 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 202.8MB in the beginning and 202.7MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:08:44,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.28ms. Allocated memory is still 226.5MB. Free memory was 200.8MB in the beginning and 181.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.35ms. Allocated memory is still 226.5MB. Free memory was 181.8MB in the beginning and 179.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,877 INFO L158 Benchmark]: Boogie Preprocessor took 15.73ms. Allocated memory is still 226.5MB. Free memory was 179.8MB in the beginning and 178.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,877 INFO L158 Benchmark]: RCFGBuilder took 260.89ms. Allocated memory is still 226.5MB. Free memory was 178.3MB in the beginning and 165.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,878 INFO L158 Benchmark]: TraceAbstraction took 3066.55ms. Allocated memory was 226.5MB in the beginning and 312.5MB in the end (delta: 86.0MB). Free memory was 165.2MB in the beginning and 225.4MB in the end (delta: -60.2MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2022-12-06 07:08:44,879 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.10ms. Allocated memory is still 226.5MB. Free memory was 202.8MB in the beginning and 202.7MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 364.28ms. Allocated memory is still 226.5MB. Free memory was 200.8MB in the beginning and 181.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.35ms. Allocated memory is still 226.5MB. Free memory was 181.8MB in the beginning and 179.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.73ms. Allocated memory is still 226.5MB. Free memory was 179.8MB in the beginning and 178.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 260.89ms. Allocated memory is still 226.5MB. Free memory was 178.3MB in the beginning and 165.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3066.55ms. Allocated memory was 226.5MB in the beginning and 312.5MB in the end (delta: 86.0MB). Free memory was 165.2MB in the beginning and 225.4MB in the end (delta: -60.2MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 55 PlacesBefore, 16 PlacesAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 14 ConcurrentYvCompositions, 0 ChoiceCompositions, 42 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 170, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 170, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 170, unknown conditional: 0, unknown unconditional: 170] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 16 PlacesBefore, 16 PlacesAfterwards, 10 TransitionsBefore, 10 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 17 PlacesBefore, 12 PlacesAfterwards, 12 TransitionsBefore, 7 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 10, Positive conditional cache size: 2, Positive unconditional cache size: 8, Negative cache size: 9, Negative conditional cache size: 1, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:08:44,904 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...